2015
DOI: 10.1007/s00373-014-1512-3
|View full text |Cite
|
Sign up to set email alerts
|

An Analogy Between Edge Colourings and Differentiable Manifolds, with a New Perspective on 3-Critical Graphs

Abstract: Il problema della colorabilità di spigoli di grafi critici viene riletto col linguaggio della geometria differenziale; in particolare la distinzione tra classe 1 e 2 diventa la nota distinzione tra presenza e assenza di orientabilità

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
3
1

Citation Types

0
4
0

Year Published

2020
2020
2022
2022

Publication Types

Select...
2
1

Relationship

1
2

Authors

Journals

citations
Cited by 3 publications
(4 citation statements)
references
References 1 publication
0
4
0
Order By: Relevance
“…Following the mentioned approach in [11], we also show that the infinite family of Goldberg's graphs disproving the "Critical Graph Conjecture" and the other two counterxamples constructed by Fiol and Chetwynd can be obtained by a suitable identification of vertices which is pretty analogous to the topological identification yielding the Möbius strip from a rectangular strip. Details about the change of language -from topology to graph theory -can be found in [11].…”
Section: Introductionmentioning
confidence: 88%
See 2 more Smart Citations
“…Following the mentioned approach in [11], we also show that the infinite family of Goldberg's graphs disproving the "Critical Graph Conjecture" and the other two counterxamples constructed by Fiol and Chetwynd can be obtained by a suitable identification of vertices which is pretty analogous to the topological identification yielding the Möbius strip from a rectangular strip. Details about the change of language -from topology to graph theory -can be found in [11].…”
Section: Introductionmentioning
confidence: 88%
“…Similarly, adding one pendant edge uw when u and v are saturating yields conflicting vertices w, v. Therefore, the above operations can be regarded as identifications of conflicting vertices in all cases. These procedures could be rephrased in terms of atlases and orientability, as explained in [11]; the prototype of this analogy is given by the odd cycle C 2n+1 of any fixed length. Such a graph is the result of the identification of two conflicting vertices, namely, the extremes of the path P 2n+2 having the same number of edges.…”
Section: Remark 22mentioning
confidence: 99%
See 1 more Smart Citation
“…We say G is obtained from G by a vertex-splitting. A vertexsplitting was formulated in terms of the "Mőbius-type gluing technique" in [1] and [7]. Hilton and Zhao [3] in 1997 propsed the following conjecture.…”
Section: Introductionmentioning
confidence: 99%