A note on k-walks in bridgeless graphs

DOI10.1007/S00373-007-0733-0zbMATH Open1124.05055OpenAlexW2031412901MaRDI QIDQ995769FDOQ995769

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

• Title not available (Why is that?)
• Flows and generalized coloring theorems in graphs
• Title not available (Why is that?)
• Title not available (Why is that?)
• Toughness, trees, and walks
• Eine gemeinsame Basis für die Theorie der Eulerschen Graphen und den Satz von Petersen
• Title not available (Why is that?)

Cited In (2)

• On 2-connected spanning subgraphs with bounded degree in \(K _{1,r }\)-free graphs
• Title not available (Why is that?)

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)