A note on \(k\)-walks in bridgeless graphs

DOI10.1007/s00373-007-0733-0zbMath1124.05055OpenAlexW2031412901MaRDI QIDQ995769

Roman Kužel, Tomáš Kaiser, Hao Li, Guang-Hui Wang

Publication date: 10 September 2007

Published in: Graphs and Combinatorics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s00373-007-0733-0

zbMATH Keywords

DegreeBridgeless graphSplitting

Mathematics Subject Classification ID

Eulerian and Hamiltonian graphs (05C45)

Related Items (1)

On 2-connected spanning subgraphs with bounded degree in \(K _{1,r }\)-free graphs

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Flows and generalized coloring theorems in graphs
• Eine gemeinsame Basis für die Theorie der Eulerschen Graphen und den Satz von Petersen
• Toughness, trees, and walks

This page was built for publication: A note on \(k\)-walks in bridgeless graphs