3-paths in graphs with bounded average degree

DOI10.7151/DMGT.1859zbMath1338.05054OpenAlexW2319747975MaRDI QIDQ274685

Mária Maceková, Roman Soták, Mickaël Montassier, Stanlislav 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

zbMATH Keywords

degree sequenceaverage degree3-pathstructural property

Mathematics Subject Classification ID

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

Related Items (8)

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

Cites Work

• Unnamed Item
• Describing 3-paths in normal plane maps
• Describing short paths in plane graphs of girth at least 5
• 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

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