Subdivisions of large complete bipartite graphs and long induced paths in k‐connected graphs

DOI10.1002/jgt.10161zbMath1050.05086OpenAlexW2600510131MaRDI QIDQ4459605

Bojan Mohar, Thomas Böhme, Riste Škrekovski, Michael Stiebitz

Publication date: 29 March 2004

Published in: Journal of Graph Theory (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1002/jgt.10161

zbMATH Keywords

Ramseycomplete bipartite graph\(k\)-connectedtopological minorinduced path

Mathematics Subject Classification ID

Paths and cycles (05C38) Graph minors (05C83) Generalized Ramsey theory (05C55)

Related Items (3)

Lower and upper bounds for long induced paths in 3-connected planar graphs ⋮ Exhaustive Generation of k-Critical $${\mathcal H}$$ -Free Graphs ⋮ Topological minors in bipartite graphs

Cites Work

• Typical subgraphs of 3- and 4-connected graphs
• Relative lengths of paths and cycles in 3-connected graphs
• Convex programming and circumference of 3-connected graphs of low genus

This page was built for publication: Subdivisions of large complete bipartite graphs and long induced paths in k‐connected graphs