Skip to main content

A Note on k-walks in Bridgeless Graphs

Graphs and Combinatorics volume 23, pages 303–308 (2007)Cite this article

Abstract

We show that every bridgeless graph of maximum degree \(\Delta\) has a spanning \(\lceil (\Delta+1)/2 \rceil\) -walk. The bound is optimal.

This is a preview of subscription content, access via your institution.

Access options

Buy single article

Instant access to the full article PDF.

USD 39.95

Price includes VAT (USA)
Tax calculation will be finalised during checkout.

References

  1. Diestel, R.: Graph Theory, Springer, New York, 2000

  2. Ellingham, M.N.: Spanning paths, cycles, trees and walks for graphs on surfaces, surveys in graph theory (San Francisco, CA, 1995), Congr. Numer. 115, 55–90 (1996)

  3. Ellingham, M.N., Zha, X.: Toughness, trees, and walks, J. Graph Theory 33, 125–137 (2000)

    Google Scholar 

  4. Fleischner, H.: Eine gemeinsame Basis für die Theorie der eulerschen Graphen und den Satz von Petersen, Monatsh. Math. 81, 267–278 (1976)

  5. Gao, Z., Richter, B.R., Yu, X.: 2-walks in 3-connected planar graphs, Australas. J. Combin. 11, 117–122 (1995)

    Google Scholar 

  6. Jackson, B., Wormald, N.C.: k-walks in graphs. Australas. J. Combin. 2, 135–146 (1990)

    Google Scholar 

  7. Jaeger, F.: On nowhere-zero flows in multigraphs. In: Proceedings of the Fifth British Combinatorial Conference 1975, Congr. Numer. 15, 373–378 (1975)

  8. Jaeger, F.: Flows and generalized coloring theorems in graphs, J. Combin. Theory Ser. B 26, 205–216 (1979)

    Google Scholar 

  9. Zhang, C.-Q.: Integer Flows and Cycle Covers of Graphs, Dekker, New York, 1997

Download references

Author information

Affiliations

  1. Department of Mathematics and Institute for Theoretical Computer Science, University of West Bohemia, Univerzitní 8, 306 14, Plzeň, Czech Republic

    Tomáš Kaiser & Roman Kužel

  2. Laboratoire de Recherche en Informatique, UMR 8623, C.N.R.S.-Université de Paris-Sud, 91405, Orsay cedex, France

    Hao Li & Guanghui Wang

  3. School of Mathematics and Statistics, Lanzhou University, 730000, Lanzhou, Gansu, China

    Hao Li

  4. School of Mathematics and System Science, Shandong University, 250100, Jinan, Shandong, China

    Guanghui Wang

Authors
  1. Tomáš Kaiser
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Roman Kužel
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Hao Li
    View author publications

    You can also search for this author in PubMed Google Scholar

  4. Guanghui Wang
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Tomáš Kaiser.

Additional information

Supported by project 1M0545 and Research Plan MSM 4977751301 of the Czech Ministry of Education.

Supported by the NSFC (60673047 and 10471078), SRSDP (20040422004) and PDSF (2004036402) of China.

Rights and permissions

Reprints and Permissions

About this article

Cite this article

Kaiser, T., Kužel, R., Li, H. et al. A Note on k-walks in Bridgeless Graphs. Graphs and Combinatorics 23, 303–308 (2007). https://doi.org/10.1007/s00373-007-0733-0

Download citation

Keywords

  • Degree
  • k-walk
  • Bridgeless graph
  • Splitting