List edge and list total colorings of planar graphs without short cycles
From MaRDI portal
Publication:975488
DOI10.1016/J.IPL.2008.07.003zbMATH Open1189.05061OpenAlexW2007370880MaRDI QIDQ975488FDOQ975488
Jianfeng Hou, Bin Liu, Guizhen Liu
Publication date: 9 June 2010
Published in: Information Processing Letters (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.ipl.2008.07.003
Graph theory (including graph drawing) in computer science (68R10) Coloring of graphs and hypergraphs (05C15) Paths and cycles (05C38)
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- List edge and list total colourings of multigraphs
- Some upper bounds on the total and list chromatic numbers of multigraphs
- List edge and list total colorings of planar graphs without 4-cycles
- 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
Cited In (15)
- List total coloring of pseudo-outerplanar graphs
- List edge coloring of planar graphs without 6-cycles with two chords
- A note on edge-choosability of planar graphs without intersecting 4-cycles
- Edge choosability and total choosability of planar graphs with no 3-cycles adjacent 4-cycles
- Total coloring of planar graphs without 6-cycles
- Planar graphs with maximum degree 7 and without 5-cycles are 8-totally-colorable
- On the 7 total colorability of planar graphs with maximum degree 6 and without 4-cycles
- Two Chromatic Conjectures: One for Vertices and One for Edges
- List total colorings of planar graphs without triangles at small distance
- Sufficient conditions for a planar graph to be list edge \(\Delta \)-colorable and list totally \((\Delta +1)\)-colorable
- List edge coloring of planar graphs without non-induced 6-cycles
- A note on list edge and list total coloring of planar graphs without adjacent short cycles
- A structural theorem for planar graphs with some applications
- List-edge-coloring of planar graphs without 6-cycles with three chords
- List injective coloring of a class of planar graphs without short cycles
Recommendations
- Title not available (Why is that?) 👍 👎
- Title not available (Why is that?) 👍 👎
- List edge and list total colorings of planar graphs without 4-cycles 👍 👎
- List edge and list total coloring of 1-planar graphs 👍 👎
- List 2-distance coloring of planar graphs without short cycles 👍 👎
- List edge coloring of planar graphs without non-induced 6-cycles 👍 👎
- 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 6-cycles with chord 👍 👎
- List injective coloring of a class of planar graphs without short 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 short cycles
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q975488)
