List edge and list total colorings of planar graphs without short cycles
From MaRDI portal
(Redirected from Publication:975488)
Recommendations
- 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 4-cycles
- A note on list edge coloring of planar graphs without adjacent short cycles.
- List edge and list total colorings of planar graphs without non-induced 7-cycles
- List edge and list total coloring of planar graphs without intersecting 8-cycles
- List injective coloring of a class of planar graphs without short cycles
- List edge and list total colorings of planar graphs without 6-cycles with chord
- List edge and list total coloring of 1-planar graphs
- List edge coloring of planar graphs without non-induced 6-cycles
- List 2-distance coloring of planar graphs without short cycles
Cites work
- scientific article; zbMATH DE number 821271 (Why is no real title available?)
- Choosability, edge choosability and total choosability of outerplane graphs
- Graph theory
- List edge and list total colorings of planar graphs without 4-cycles
- List edge and list total colourings of multigraphs
- New Bounds on the List-Chromatic Index of the Complete Graph and Other Simple Graphs
- Some upper bounds on the total and list chromatic numbers of multigraphs
- The list chromatic index of a bipartite multigraph
Cited in
(26)- A structural theorem for planar graphs with some applications
- List total coloring of pseudo-outerplanar graphs
- Total colorings and list total colorings of planar graphs without intersecting 4-cycles
- List injective coloring of a class of planar graphs without short cycles
- List edge coloring of planar graphs without non-induced 6-cycles
- List edge and list total colorings of planar graphs without 4-cycles
- Planar graphs with maximum degree 7 and without 5-cycles are 8-totally-colorable
- \(k\)-frugal list coloring of planar graphs without small cycles
- Planar graphs without 5-cycles or without 6-cycles
- A note on edge-choosability of planar graphs without intersecting 4-cycles
- On the 7 total colorability of planar graphs with maximum degree 6 and without 4-cycles
- \(k\)-frugal list coloring of planar graphs without 4 and 5-cycles
- Two Chromatic Conjectures: One for Vertices and One for Edges
- List total colorings of planar graphs without triangles at small distance
- Total coloring of planar graphs without 6-cycles
- Edge choosability and total choosability of planar graphs with no 3-cycles adjacent 4-cycles
- List edge and list total colorings of planar graphs with adjacent triangles
- List edge and list total colorings of planar graphs without 6-cycles with chord
- Structural properties and edge choosability of planar graphs without 6-cycles
- List edge and list total colorings of planar graphs without non-induced 7-cycles
- List coloring of planar graphs with forbidden cycles
- The list edge coloring and list total coloring of planar graphs with maximum degree at least 7
- List edge coloring of planar graphs without 6-cycles with two chords
- List-edge-coloring of planar graphs without 6-cycles with three chords
- 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
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)
