Forests decomposition of graphs without 4-cycles

DOI10.11826/J.ISSN.1000-5854.2014.01.003MaRDI QIDQ2926959zbMATH OpenFDO

Authors Lixin Wu

Publication date 3 November 2014

Published in Journal of Hebei Normal University. Natural Science Edition (Search for Journal in Brave)

Full work available at URL https://doi.org/10.11826/J.ISSN.1000-5854.2014.01.003

zbMATH Keywords

4-cyclesEuler characteristicNC-graphs

Mathematics Subject Classification ID

Planar graphs; geometric and topological aspects of graph theory (05C10)

Recommendations

• Decomposition of planar graphs without 5-cycles or K₄
• Decompositions of quadrangle-free planar graphs
• Forest leaves and four-cycles
• Decomposing a graph into forests
• Partitioning planar graphs without 4-cycles and 6-cycles into a linear forest and a forest

Cited in

(4)

• Decomposition of planar graphs without 5-cycles or K₄
• Forest leaves and four-cycles
• Decompositions of quadrangle-free planar graphs
• Decomposing graphs of nonnegative characteristic into subgraphs with degree restrictions

This page was built for publication: Forests decomposition of graphs without 4-cycles

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