A note on k-walks in bridgeless graphs

DOI10.1007/S00373-007-0733-0MaRDI QIDQ995769zbMATH OpenOpenAlexFDO

Authors Tomáš Kaiser, Roman Kužel, Hao Li, Guanghui 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)

Cites work

• scientific article; zbMATH DE number 68918 (Why is no real title available?)
• scientific article; zbMATH DE number 1156578 (Why is no real title available?)
• scientific article; zbMATH DE number 786140 (Why is no real title available?)
• scientific article; zbMATH DE number 1432797 (Why is no real title available?)
• Eine gemeinsame Basis für die Theorie der Eulerschen Graphen und den Satz von Petersen
• Flows and generalized coloring theorems in graphs
• Toughness, trees, and walks

Cited in

(2)

• On 2-connected spanning subgraphs with bounded degree in \(K _{1,r }\)-free graphs
• scientific article; zbMATH DE number 2104724 (Why is no real title available?)

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

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