A note on edge-choosability of planar graphs without intersecting 4-cycles
From MaRDI portal
Publication:545596
DOI10.1007/S12190-010-0408-5zbMath1222.05069OpenAlexW2052246165MaRDI QIDQ545596
Jian-Sheng Cai, Qiao Ling Ma, Ji Hui Wang, Su-Mei Zhang
Publication date: 22 June 2011
Published in: Journal of Applied Mathematics and Computing (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s12190-010-0408-5
Cites Work
- List edge and list total colorings of planar graphs without 4-cycles
- List edge and list total colorings of planar graphs without short cycles
- Structural properties and edge choosability of planar graphs without 4-cycles
- Edge-choosability of planar graphs without adjacent triangles or without 7-cycles
- List-colourings of graphs
- 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
- Structural Properties and Edge Choosability of Planar Graphs without 6-Cycles
- A Note on Edge Choosability and Degeneracy of Planar Graphs
- 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
- Choosability and Edge Choosability of Planar Graphs without Intersecting Triangles
This page was built for publication: A note on edge-choosability of planar graphs without intersecting 4-cycles
