Facial list colourings of plane graphs
From MaRDI portal
Publication:2629297
DOI10.1016/j.disc.2016.05.034zbMath1339.05130OpenAlexW2441015039MaRDI QIDQ2629297
Igor Fabrici, Stanlislav Jendroľ, Margit Voigt
Publication date: 5 July 2016
Published in: Discrete Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.disc.2016.05.034
Planar graphs; geometric and topological aspects of graph theory (05C10) Coloring of graphs and hypergraphs (05C15) Connectivity (05C40)
Related Items (8)
Graph polynomials and paintability of plane graphs ⋮ Zig-zag facial total-coloring of plane graphs ⋮ Facially-constrained colorings of plane graphs: a survey ⋮ Facial unique-maximum edge and total coloring of plane graphs ⋮ Edge-coloring of plane multigraphs with many colors on facial cycles ⋮ Facial \([r,s,t\)-colorings of plane graphs] ⋮ Unnamed Item ⋮ Facial visibility in edge colored plane graphs
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- List colourings of planar graphs
- List edge and list total colorings of planar graphs without 4-cycles
- Facial entire colouring of plane graphs
- List-edge and list-total colorings of graphs embedded on hyperbolic surfaces
- Total colorings of planar graphs without adjacent triangles
- Generalization of a theorem of Kotzig and a prescribed coloring of the edges of planar graphs
- Graphs drawn with few crossings per edge
- Simultaneous coloring of edges and faces of plane graphs
- Structure of neighborhoods of edges in planar graphs and simultaneous coloring of vertices, edges and faces
- Every planar graph is 5-choosable
- List edge and list total colourings of multigraphs
- The edge-face choosability of plane graphs
- Colorings of plane graphs: a survey
- A new proof of 3-colorability of Eulerian triangulations
- Some totally 4-choosable multigraphs
- On the total coloring of planar graphs.
- Structural theorem on plane graphs with application to the entire coloring number
- A new proof of the 6 color theorem
- Coupled choosability of plane graphs
This page was built for publication: Facial list colourings of plane graphs