Total colorings and list total colorings of planar graphs without intersecting 4-cycles
From MaRDI portal
Publication:1045095
DOI10.1016/j.disc.2009.05.006zbMath1204.05047OpenAlexW2073513683MaRDI QIDQ1045095
Bin Liu, Gui Zhen Liu, Jian-Feng Hou, Jian Liang Wu
Publication date: 15 December 2009
Published in: Discrete Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.disc.2009.05.006
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
A note on the minimum number of choosability of planar graphs ⋮ List edge and list total coloring of planar graphs without intersecting 8-cycles ⋮ Total coloring of planar graphs without chordal 7-cycles ⋮ Total coloring of planar graphs without short cycles ⋮ List edge and list total coloring of planar graphs with maximum degree 8 ⋮ Total colorings of embedded graphs with no 3-cycles adjacent to 4-cycles ⋮ Total coloring of planar graphs without adjacent chordal 6-cycles ⋮ List total coloring of pseudo-outerplanar graphs ⋮ Total coloring of planar graphs with maximum degree 8 ⋮ Planar graphs with maximum degree 8 and without intersecting chordal 4-cycles are 9-totally colorable ⋮ \((\Delta + 1)\)-total-colorability of plane graphs with maximum degree \(\Delta\) at least 6 and without adjacent short cycles ⋮ On the total choosability of planar graphs and of sparse graphs ⋮ Optimal channel assignment with list-edge coloring ⋮ \((\Delta +1)\)-total-colorability of plane graphs of maximum degree \(\Delta\geq 6\) with neither chordal \(5\)-cycle nor chordal \(6\)-cycle ⋮ A note on the total coloring of planar graphs without adjacent 4-cycles ⋮ (\( \Delta + 1\))-total choosability of planar graphs with no cycles of length from 4 to \(k\) and without close triangles ⋮ Total colorings of planar graphs with maximum degree seven and without intersecting 3-cycles ⋮ Edge choosability and total choosability of planar graphs with no 3-cycles adjacent 4-cycles ⋮ Total colorings of planar graphs without intersecting 5-cycles ⋮ A note on list edge and list total coloring of planar graphs without adjacent short cycles ⋮ Total colorings of planar graphs without chordal 6-cycles ⋮ Minimum total coloring of planar graph ⋮ Total coloring of graphs embedded in surfaces of nonnegative Euler characteristic ⋮ A sufficient condition for planar graphs with maximum degree 8 to be 9-totally colorable ⋮ Total coloring of planar graphs without chordal short cycles ⋮ Total coloring of planar graphs without adjacent short cycles ⋮ Planar graphs with maximum degree 7 and without 5-cycles are 8-totally-colorable ⋮ A structural theorem for planar graphs with some applications ⋮ Minimum choosability of planar graphs ⋮ List edge colorings of planar graphs without adjacent 7-cycles ⋮ Two Chromatic Conjectures: One for Vertices and One for Edges ⋮ Total tessellation cover: bounds, hardness, and applications
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- List edge and list total colorings of planar graphs without 4-cycles
- Determining the total colouring number is NP-hard
- Total colorings of planar graphs without small cycles
- Edge-choosability of planar graphs without adjacent triangles or without 7-cycles
- Total colorings of planar graphs without adjacent triangles
- The Hall number, the Hall index, and the total Hall number of a graph
- The total chromatic number of any multigraph with maximum degree five is at most seven
- List edge and list total colourings of multigraphs
- Total colourings of planar graphs with large girth
- Choosability, edge choosability and total choosability of outerplane graphs
- On the total coloring of certain graphs
- Total chromatic number of planar graphs with maximum degree ten
- On the total coloring of planar graphs.
- Some upper bounds on the total and list chromatic numbers of multigraphs
- List Total Colourings of Graphs
- On total 9-coloring planar graphs of maximum degree seven
- A note on total colorings of planar graphs without 4-cycles
- On Total Chromatic Number of a Graph
