List edge and list total colorings of planar graphs without 4-cycles

DOI10.1016/j.tcs.2006.08.043zbMath1108.05038OpenAlexW2050609896MaRDI QIDQ861265

Jian-Sheng Cai, Gui Zhen Liu, Jian-Feng Hou

Publication date: 9 January 2007

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.tcs.2006.08.043

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15)

Related Items (32)

A note on the minimum number of choosability of planar graphs ⋮ List edge and list total coloring of planar graphs without intersecting 8-cycles ⋮ Facial list colourings of plane graphs ⋮ List edge and list total coloring of planar graphs with maximum degree 8 ⋮ Edge DP-coloring in planar graphs ⋮ List total coloring of pseudo-outerplanar graphs ⋮ Total coloring of planar graphs with maximum degree 8 ⋮ \((\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 ⋮ The list edge coloring and list total coloring of planar graphs with maximum degree at least 7 ⋮ Total coloring of embedded graphs of maximum degree at least ten ⋮ List total colorings of planar graphs without triangles at small distance ⋮ List-edge-coloring of planar graphs without 6-cycles with three chords ⋮ (\( \Delta + 1\))-total choosability of planar graphs with no cycles of length from 4 to \(k\) and without close triangles ⋮ Edge choosability and total choosability of planar graphs with no 3-cycles adjacent 4-cycles ⋮ A note on list edge and list total coloring of planar graphs without adjacent short cycles ⋮ List edge coloring of planar graphs without 6-cycles with two chords ⋮ Total colorings of planar graphs without small cycles ⋮ Planar graphs with maximum degree 8 and without adjacent triangles are 9-totally-colorable ⋮ A note on edge-choosability of planar graphs without intersecting 4-cycles ⋮ List edge and list total colorings of planar graphs without 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 ⋮ Planar graphs without 5-cycles or without 6-cycles ⋮ Total colorings of planar graphs with maximum degree at least 8 ⋮ On the 7 total colorability of planar graphs with maximum degree 6 and without 4-cycles ⋮ Total colorings and list total colorings of planar graphs without intersecting 4-cycles ⋮ Two Chromatic Conjectures: One for Vertices and One for Edges ⋮ List edge coloring of planar graphs without non-induced 6-cycles

Cites Work

• Unnamed Item
• Edge-choosability in line-perfect multigraphs
• Edge-choosability of multicircuits
• List edge and list total colourings of multigraphs
• Choosability, edge choosability and total choosability of outerplane graphs
• On structure of some plane graphs with application to choosability
• The list chromatic index of a bipartite multigraph
• Some upper bounds on the total and list chromatic numbers of multigraphs
• New Bounds on the List-Chromatic Index of the Complete Graph and Other Simple Graphs
• A note on total colorings of planar graphs without 4-cycles
• 25 pretty graph colouring problems

This page was built for publication: List edge and list total colorings of planar graphs without 4-cycles