List edge and list total colorings of planar graphs without 4-cycles
From MaRDI portal
Publication:861265
DOI10.1016/J.TCS.2006.08.043zbMATH Open1108.05038OpenAlexW2050609896MaRDI QIDQ861265FDOQ861265
Authors: Jianfeng Hou, Guizhen Liu, Jiansheng Cai 
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
Recommendations
- List edge and list total colorings of planar graphs without short cycles
- Sufficient conditions for a planar graph to be list edge \(\Delta \)-colorable and list totally \((\Delta +1)\)-colorable
- A note on list edge and list total coloring of planar graphs without adjacent short cycles
- List edge and list total colorings of planar graphs without non-induced 7-cycles
- Edge choosability and total choosability of planar graphs with no 3-cycles adjacent 4-cycles
Cites Work
- Graph theory
- List edge and list total colourings of multigraphs
- Some upper bounds on the total and list chromatic numbers of multigraphs
- A note on total colorings of planar graphs without 4-cycles
- 25 pretty graph colouring problems
- The list chromatic index of a bipartite multigraph
- New Bounds on the List-Chromatic Index of the Complete Graph and Other Simple Graphs
- Choosability, edge choosability and total choosability of outerplane graphs
- Edge-choosability of multicircuits
- On structure of some plane graphs with application to choosability
- Edge-choosability in line-perfect multigraphs
Cited In (36)
- List total coloring of pseudo-outerplanar graphs
- List edge coloring of planar graphs without 6-cycles with two chords
- A note on the minimum number of choosability of planar graphs
- On the total choosability of planar graphs and of sparse graphs
- Total colorings of planar graphs without small cycles
- List edge and list total colorings of planar graphs without short cycles
- A note on edge-choosability of planar graphs without intersecting 4-cycles
- \(k\)-frugal list coloring of planar graphs without 4 and 5-cycles
- Total colorings of planar graphs with maximum degree at least 8
- Edge choosability and total choosability of planar graphs with no 3-cycles adjacent 4-cycles
- 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
- Total colorings and list total colorings of planar graphs without intersecting 4-cycles
- Planar graphs with maximum degree 7 and without 5-cycles are 8-totally-colorable
- Optimal channel assignment with list-edge coloring
- Planar graphs with maximum degree 8 and without adjacent triangles are 9-totally-colorable
- (\( \Delta + 1\))-total choosability of planar graphs with no cycles of length from 4 to \(k\) and without close triangles
- On the 7 total colorability of planar graphs with maximum degree 6 and without 4-cycles
- Minimum choosability of planar graphs
- Two Chromatic Conjectures: One for Vertices and One for Edges
- List total colorings of planar graphs without triangles at small distance
- List edge and list total colorings of planar graphs without non-induced 7-cycles
- Facial list colourings of plane graphs
- List edge coloring of planar graphs without non-induced 6-cycles
- Edge DP-coloring in planar graphs
- List edge and list total coloring of planar graphs with maximum degree 8
- A note on list edge and list total coloring of planar graphs without adjacent short cycles
- List edge colorings of planar graphs without adjacent 7-cycles
- List edge and list total colorings of planar graphs without 6-cycles with chord
- Total coloring of embedded graphs of maximum degree at least ten
- The list edge coloring and list total coloring of planar graphs with maximum degree at least 7
- A structural theorem for planar graphs with some applications
- List coloring of planar graphs with forbidden cycles
- List-edge-coloring of planar graphs without 6-cycles with three chords
- Planar graphs without 5-cycles or without 6-cycles
- List edge and list total coloring of planar graphs without intersecting 8-cycles
This page was built for publication: List edge and list total colorings of planar graphs without 4-cycles
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q861265)
