Facial entire colouring of plane graphs
From MaRDI portal
Publication:898120
DOI10.1016/j.disc.2015.09.011zbMath1327.05108OpenAlexW2130820743MaRDI QIDQ898120
Igor Fabrici, Stanlislav Jendroľ, Michaela Vrbjarová
Publication date: 8 December 2015
Published in: Discrete Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.disc.2015.09.011
Planar graphs; geometric and topological aspects of graph theory (05C10) Coloring of graphs and hypergraphs (05C15)
Related Items
Facial list colourings of plane graphs, Odd facial colorings of acyclic plane graphs, Zig-zag facial total-coloring of plane graphs, Facial edge-face coloring of \(K_4\)-minor-free graphs, Facial \([r,s,t\)-colorings of plane graphs], Unnamed Item
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Entire colouring of plane graphs
- Plane graphs with maximum degree 6 are edge-face 8-colorable
- The structure of 1-planar graphs
- On simultaneous edge-face colorings of plane graphs
- Simultaneous coloring of edges and faces of plane graphs
- Simultaneously colouring the edges and faces of plane graphs
- The total chromatic number of any multigraph with maximum degree five is at most seven
- A new proof of Melnikov's conjecture on the edge-face coloring of plane graphs
- Planar graphs of maximum degree seven are Class I
- Colorings of plane graphs: a survey
- Unique-maximum edge-colouring of plane graphs with respect to faces
- Ein Sechsfarbenproblem auf der Kugel
- On the total coloring of certain graphs
- A seven-color theorem on the sphere
- Edge-face coloring of plane graphs with maximum degree nine
- On the total coloring of planar graphs.
- Every planar map is four colorable
- On total 9-coloring planar graphs of maximum degree seven
- Structural theorem on plane graphs with application to the entire coloring number
- On Total Chromatic Number of a Graph
- Every planar graph with maximum degree 7 is of class 1
