Parity versions of 2-connectedness.
Little, C., Vince, A. (2006)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
Displaying similar documents to “Another characterisation of planar graphs.”
Parity versions of 2-connectedness.
Uniquely edge colourable graphs
Juraj Bosák (1984)
Mathematica Slovaca
Similarity:
Characterization of magic graphs
Samuel Jezný, Marián Trenkler (1983)
Czechoslovak Mathematical Journal
Similarity:
A note on the edge-connectivity of cages.
Wang, Ping, Xu, Baoguang, Wang, Jianfang (2003)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
A structural property of planar graphs and the simultaneous colouring of their edges and faces
Oleg V. Borodin (1990)
Mathematica Slovaca
Similarity:
Connectivity of planar graphs.
de Fraysseix, Hubert, Ossona de Mendez, Patrice (2001)
Journal of Graph Algorithms and Applications
Similarity:
The structure of plane graphs with independent crossings and its applications to coloring problems
Xin Zhang, Guizhen Liu (2013)
Open Mathematics
Similarity:
If a graph G has a drawing in the plane in such a way that every two crossings are independent, then we call G a plane graph with independent crossings or IC-planar graph for short. In this paper, the structure of IC-planar graphs with minimum degree at least two or three is studied. By applying their structural results, we prove that the edge chromatic number of G is Δ if Δ ≥ 8, the list edge (resp. list total) chromatic number of G is Δ (resp. Δ + 1) if Δ ≥ 14 and the linear arboricity...