List edge coloring of planar graphs without 6-cycles with two chords
From MaRDI portal
Publication:2214317
DOI10.7151/dmgt.2183zbMath1453.05034OpenAlexW2902947528WikidataQ128836344 ScholiaQ128836344MaRDI QIDQ2214317
Lei Sun, Linna Hu, Jian Liang Wu
Publication date: 8 December 2020
Published in: Discussiones Mathematicae. Graph Theory (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.7151/dmgt.2183
Paths and cycles (05C38) Planar graphs; geometric and topological aspects of graph theory (05C10) Coloring of graphs and hypergraphs (05C15)
Cites Work
- Unnamed Item
- Unnamed Item
- List edge and list total colorings of planar graphs without 4-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
- 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
