Entire colouring of plane graphs
From MaRDI portal
Publication:651038
DOI10.1016/j.jctb.2011.02.006zbMath1234.05106OpenAlexW2050917159MaRDI QIDQ651038
Publication date: 8 December 2011
Published in: Journal of Combinatorial Theory. Series B (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.jctb.2011.02.006
Planar graphs; geometric and topological aspects of graph theory (05C10) Coloring of graphs and hypergraphs (05C15)
Related Items (20)
The entire choosability of plane graphs ⋮ A note on adjacent vertex distinguishing colorings of graphs ⋮ Plane graphs with maximum degree 9 are entirely 11-choosable ⋮ Entire \((\varDelta +2)\)-colorability of plane graphs ⋮ A survey of irregularity strength ⋮ The entire chromatic number of graphs embedded on the torus with large maximum degree ⋮ Plane Graphs with Maximum Degree Are Entirely ‐Colorable ⋮ Entire coloring of 2-connected plane graphs ⋮ Plane graphs with \(\Delta = 7\) are entirely 10-colorable ⋮ Simultaneous coloring of vertices and incidences of outerplanar graphs ⋮ Facial entire colouring of plane graphs ⋮ A note on entire choosability of plane graphs ⋮ Unnamed Item ⋮ A note on face coloring entire weightings of plane graphs ⋮ A note on vertex colorings of plane graphs ⋮ On entire face irregularity strength of disjoint union of plane graphs ⋮ The total face irregularity strength of some plane graphs ⋮ Entire coloring of graphs embedded in a surface of nonnegative characteristic ⋮ Entire coloring of plane graph with maximum degree eleven ⋮ Circular flow number of highly edge connected signed graphs
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- On simultaneous edge-face colorings of plane graphs
- Upper bounds of entire chromatic number of plane graphs
- 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
- Simultaneously colouring the edges and faces of plane graphs
- The total chromatic number of any multigraph with maximum degree five is at most seven
- List edge and list total colourings of multigraphs
- A new proof of Melnikov's conjecture on the edge-face coloring of plane graphs
- Planar graphs of maximum degree seven are Class I
- The edge-face choosability of plane graphs
- 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
- Total chromatic number of planar graphs with maximum degree ten
- Total-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
- Total colorings of planar graphs with large maximum degree
- On the Entire Coloring Conjecture
- Structural theorem on plane graphs with application to the entire coloring number
- A new proof of the 6 color theorem
- On the vertex face total chromatic number of planar graphs
- Coupled choosability of plane graphs
- On Total Chromatic Number of a Graph
- 25 pretty graph colouring problems
- Every planar graph with maximum degree 7 is of class 1
- On improving the edge-face coloring theorem
This page was built for publication: Entire colouring of plane graphs
