Dual Connectivity in Graphs
An edge-coloring <inline-formula><math xmlns="http://www.w3.org/1998/Math/MathML" display="inline"><semantics><mi>σ</mi></semantics></math></inline-formula> of a connected graph <i>G</i> is called rainbow if there exists...
| मुख्य लेखकों: | , , |
|---|---|
| स्वरूप: | लेख |
| भाषा: | English |
| प्रकाशित: |
MDPI AG
2025-01-01
|
| श्रृंखला: | Mathematics |
| विषय: | |
| ऑनलाइन पहुंच: | https://www.mdpi.com/2227-7390/13/2/229 |