3-paths in graphs with bounded average degree

DOI10.7151/DMGT.1859zbMATH Open1338.05054OpenAlexW2319747975MaRDI QIDQ274685FDOQ274685

Authors: Mária Maceková, Mickaël Montassier, Roman Soták, Stanislav Jendroľ 

Publication date: 25 April 2016

Published in: Discussiones Mathematicae Graph Theory (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.7151/dmgt.1859

Recommendations

• Optimal unavoidable sets of types of 3-paths for planar graphs of given girth
• Paths with restricted degrees of their vertices in planar graphs
• Note on 3-paths in plane graphs of girth 4
• Light subgraphs in graphs with average degree at most four
• Weight of 3-paths in sparse plane graphs

zbMATH Keywords

average degreedegree sequence3-pathstructural property

Mathematics Subject Classification ID

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

Cites Work

• Graph theory
• On the maximum average degree and the oriented chromatic number of a graph
• A structural property of convex 3-polytopes
• Light edges in degree-constrained graphs
• Note on 3-paths in plane graphs of girth 4
• Describing 3-paths in normal plane maps
• Describing short paths in plane graphs of girth at least 5

Cited In (8)

• 3-vertices with fewest 2-neighbors in plane graphs with no long paths of 2-vertices
• All tight descriptions of 3-paths in plane graphs with girth at least 9
• All one-term tight descriptions of 3-paths in normal plane maps without \(K_4 - e\)
• Light 3-stars in sparse plane graphs
• Light subgraphs in graphs with average degree at most four
• All tight descriptions of 3-paths in plane graphs with girth 8
• All tight descriptions of 3-paths centered at 2-vertices in plane graphs with girth at least 6
• All tight descriptions of 3-paths in plane graphs with girth at least 7

This page was built for publication: 3-paths in graphs with bounded average degree

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