A structural theorem for planar graphs with some applications
From MaRDI portal
Publication:2275921
DOI10.1016/j.dam.2011.03.005zbMath1223.05251OpenAlexW1978056007MaRDI QIDQ2275921
Publication date: 10 August 2011
Published in: Discrete Applied Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.dam.2011.03.005
planar graphlist edge-coloringintersecting triangleslist total coloringlinear 2-arboricityedge-partition
Planar graphs; geometric and topological aspects of graph theory (05C10) Structural characterization of families of graphs (05C75) Coloring of graphs and hypergraphs (05C15)
Related Items
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- On the total choosability of planar graphs and of sparse graphs
- On linear k-arboricity
- List edge and list total colorings of planar graphs without 4-cycles
- List edge and list total colorings of planar graphs without short cycles
- Planar graphs without 5-cycles or without 6-cycles
- Total colorings and list total colorings of planar graphs without intersecting 4-cycles
- Some problems about linear arboricity
- List edge and list total colourings of multigraphs
- The linear 2-arboricity of planar graphs