List-edge-coloring of planar graphs without 6-cycles with three chords
From MaRDI portal
Publication:1702837
DOI10.1007/s10878-017-0193-2zbMath1386.05071OpenAlexW2766211648MaRDI QIDQ1702837
Publication date: 1 March 2018
Published in: Journal of Combinatorial Optimization (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10878-017-0193-2
Paths and cycles (05C38) Planar graphs; geometric and topological aspects of graph theory (05C10) Coloring of graphs and hypergraphs (05C15)
Related Items (3)
List edge and list total coloring of planar graphs without intersecting 8-cycles ⋮ Edge DP-coloring in planar graphs ⋮ List edge colorings of planar graphs without adjacent 7-cycles
Cites Work
- Unnamed Item
- Unnamed Item
- On the total choosability of planar graphs and of sparse graphs
- List edge and list total colorings of planar graphs without 4-cycles
- Total colorings of planar graphs without small cycles
- List edge and list total colorings of planar graphs without short cycles
- Edge-choosability of planar graphs without non-induced 5-cycles
- List-edge and list-total colorings of graphs embedded on hyperbolic surfaces
- Structural properties and edge choosability of planar graphs without 4-cycles
- Edge-choosability of planar graphs without adjacent triangles or without 7-cycles
- List edge chromatic number of graphs with large girth
- Edge-choosability of multicircuits
- List edge and list total colourings of multigraphs
- Choosability and edge choosability of planar graphs without five cycles
- Edge choosability of planar graphs without small cycles
- Choosability, edge choosability and total choosability of outerplane graphs
- The list chromatic index of a bipartite multigraph
- List edge coloring of planar graphs without non-induced 6-cycles
- Structural Properties and Edge Choosability of Planar Graphs without 6-Cycles
- Planar graphs with $\Delta\geq 8$ are ($\Delta+1$)-edge-choosable
- 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
- Graphs of degree 4 are 5-edge-choosable
This page was built for publication: List-edge-coloring of planar graphs without 6-cycles with three chords
