Coloring vertices and faces of locally planar graphs
From MaRDI portal
Publication:855294
DOI10.1007/S00373-006-0653-4zbMATH Open1106.05038OpenAlexW1994609765MaRDI QIDQ855294FDOQ855294
Michael O. Albertson, Bojan Mohar
Publication date: 5 January 2007
Published in: Graphs and Combinatorics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s00373-006-0653-4
Recommendations
- Colouring vertices of plane graphs under restrictions given by faces
- Extending colorings of locally planar graphs
- scientific article
- Acyclic colorings of locally planar graphs
- Colorability of planar graphs with isolated nontriangular faces
- scientific article; zbMATH DE number 2188610
- Facial entire colouring of plane graphs
- On the local colorings of graphs
- Coloring graphs with locally few colors
- Structure of neighborhoods of edges in planar graphs and simultaneous coloring of vertices, edges and faces
Planar graphs; geometric and topological aspects of graph theory (05C10) Coloring of graphs and hypergraphs (05C15)
Cites Work
- Graphs on surfaces
- A new proof of the 6 color theorem
- Five-coloring maps on surfaces
- A new lower bound on the number of edges in colour-critical graphs and hypergraphs
- Dirac's map-color theorem for choosability
- Acyclic colouring of 1-planar graphs
- Ein 7-Farbensatz 1-einbettbarer Graphen auf der projektiven Ebene
- An infinite series of surfaces with known 1-chromatic number
- On the 1-chromatic number of nonorientable surfaces with large genus
- The Independence Ratio and Genus of a Graph
- The vertex-face total chromatic number of Halin graphs
- A list version of Dirac's theorem on the number of edges in colour-critical graphs
- On the vertex face total chromatic number of planar graphs
- Extending precolorings of subgraphs of locally planar graphs
Cited In (15)
- 1-Planar Graphs
- Facial packing vertex-coloring of subdivided plane graphs
- Colorability of planar graphs with isolated nontriangular faces
- Coloring vertices and faces of maps on surfaces
- On total colorings of 1-planar graphs
- An upper bound on the sum of powers of the degrees of simple 1-planar graphs
- Non-1-planarity of lexicographic products of graphs
- Entire coloring of graphs embedded in a surface of nonnegative characteristic
- Partially broken orientations of Eulerian plane graphs
- Coloring locally bipartite graphs on surfaces.
- On \((p,1)\)-total labelling of 1-planar graphs
- List edge and list total coloring of 1-planar graphs
- Finite fields and the 1‐chromatic number of orientable surfaces
- Dynamic list coloring of 1-planar graphs
- Light subgraphs in the family of 1-planar graphs with high minimum degree
This page was built for publication: Coloring vertices and faces of locally planar graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q855294)
