A structural theorem on embedded graphs and its application to colorings
From MaRDI portal
Publication:1034219
DOI10.1007/s10114-008-7011-9zbMath1190.05054OpenAlexW1995274255MaRDI QIDQ1034219
Publication date: 11 November 2009
Published in: Acta Mathematica Sinica. English Series (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10114-008-7011-9
Planar graphs; geometric and topological aspects of graph theory (05C10) Coloring of graphs and hypergraphs (05C15) Graph labelling (graceful graphs, bandwidth, etc.) (05C78)
Related Items (5)
Impulsive integral BVP for nonlinear integro-differential equation with monotone homomorphism in Banach spaces ⋮ On the restricted arc-connectivity of \(s\)-geodetic digraphs ⋮ On second order degree of graphs ⋮ Genus polynomials of cycles with double edges ⋮ Commutative rings whose zero-divisor graph is a proper refinement of a star graph
Cites Work
- On 3-colorable plane graphs without 5- and 7-cycles
- A sufficient condition for planar graphs to be 3-colorable
- On structure of graphs embedded on surfaces of nonnegative characteristic with application to choosability
- Planar graphs without cycles of length from 4 to 7 are 3-colorable
- A note on the three color problem
- On structure of some plane graphs with application to choosability
- On vertex types and cyclic colourings of 3-connected plane graphs
- A 3-color theorem on plane graphs without 5-circuits
- Quelques consequences simples de la formule d'Euler
- Structural properties of plane graphs without adjacent triangles and an application to 3-colorings
- 3-Coloring graphs embedded in surfaces
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: A structural theorem on embedded graphs and its application to colorings
