The list linear arboricity of planar graphs with 7-cycles containing at most two chords

DOI10.1016/J.AMC.2019.124565MaRDI QIDQ2286100zbMATH OpenOpenAlexWikidataFDO

Authors Renyu Xu

Publication date 9 January 2020

Published in Applied Mathematics and Computation (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.amc.2019.124565

zbMATH Keywords

linear arboricitylist coloringlist linear arboricityplanar graph

Mathematics Subject Classification ID

Trees (05C05) Planar graphs; geometric and topological aspects of graph theory (05C10) Coloring of graphs and hypergraphs (05C15) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)

Recommendations

• List-edge-coloring of planar graphs without 6-cycles with three chords
• List edge coloring of planar graphs without 6-cycles with two chords
• Edge-choosability of planar graphs without chordal 7-cycles.
• Edge-choosability of planar graphs without chordal 6-cycles
• Minimum choosability of planar graphs

Cites work

• Covering and packing in graphs IV: Linear arboricity
• COVERING AND PACKING IN GRAPHS, I.
• Graph theory with applications
• scientific article; zbMATH DE number 3717365 (Why is no real title available?)
• scientific article; zbMATH DE number 1299961 (Why is no real title available?)
• The linear arboricity of composition graphs
• The linear arboricity of planar graphs of maximum degree seven is four
• The linear arboricity of planar graphs without 5-cycles with two chords
• The linear arboricity of some regular graphs
• The list linear arboricity of planar graphs

Cited in

(1)

• The linear arboricity of planar graphs of maximum degree seven is four

This page was built for publication: The list linear arboricity of planar graphs with 7-cycles containing at most two chords

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2286100)