Edge-choosability of planar graphs without non-induced 5-cycles
From MaRDI portal
Publication:976112
DOI10.1016/J.IPL.2008.12.001zbMATH Open1189.05058OpenAlexW2024763003MaRDI QIDQ976112FDOQ976112
Guizhen Liu, Jiansheng Cai, Jianfeng Hou, Xia Zhang
Publication date: 16 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.12.001
Recommendations
- Choosability and edge choosability of planar graphs without five cycles
- Edge choosability of planar graphs without 5-cycles with a chord
- A note on edge-group choosability of planar graphs without 5-cycles
- Edge choosability of planar graphs without small cycles
- Acyclic 5-choosability of planar graphs without 4-cycles
- Acyclic 5-choosability of planar graphs without 4-cycles
- Edge choosability of planar graphs without short cycles
- Acyclic 5-choosability of planar graphs without small cycles
- Acyclic 5-choosability of planar graphs without adjacent short cycles
- scientific article; zbMATH DE number 6914816
Coloring of graphs and hypergraphs (05C15) Graph labelling (graceful graphs, bandwidth, etc.) (05C78)
Cites Work
- List edge and list total colourings of multigraphs
- Title not available (Why is that?)
- Some upper bounds on the total and list chromatic numbers of multigraphs
- 25 pretty graph colouring problems
- 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
- Choosability and edge choosability of planar graphs without five cycles
- Structural properties and edge choosability of planar graphs without 6-cycles
- Edge-choosability of multicircuits
- Edge choosability of planar graphs without small cycles
- Graphs of degree 4 are 5-edge-choosable
- Choosability and Edge Choosability of Planar Graphs without Intersecting Triangles
- List edge chromatic number of graphs with large girth
- Structural properties and edge choosability of planar graphs without 4-cycles
Cited In (7)
- List edge coloring of planar graphs without 6-cycles with two chords
- Planar graphs without intersecting 5-cycles are signed-4-choosable
- A note on edge-group choosability of planar graphs without 5-cycles
- Choosability and edge choosability of planar graphs without five cycles
- List edge coloring of planar graphs without non-induced 6-cycles
- List-edge-coloring of planar graphs without 6-cycles with three chords
- Title not available (Why is that?)
This page was built for publication: Edge-choosability of planar graphs without non-induced 5-cycles
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q976112)
