3-paths in graphs with bounded average degree

DOI10.7151/DMGT.1859MaRDI QIDQ274685zbMATH OpenOpenAlexFDO

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)

Copyright license Creative Commons Attribution-NonCommercial-NoDerivatives 4.0 International

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

zbMATH Keywords

average degreedegree sequence3-pathstructural property

Mathematics Subject Classification ID

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

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

Cites work

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

Cited in

(9)

• 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
• All tight descriptions of 3-paths in plane graphs with girth at least 7
• Optimal unavoidable sets of types of 3-paths for planar graphs of given girth
• All tight descriptions of 3-paths in plane graphs with girth 8
• All tight descriptions of 3-paths in plane graphs with girth at least 9
• Light 3-stars in sparse plane graphs
• 3-vertices with fewest 2-neighbors in plane graphs with no long paths of 2-vertices
• Light subgraphs in graphs with average degree at most four

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)