A decomposition of locally finite graphs

DOI10.1016/0012-365X(93)90332-NzbMATH Open0782.05066OpenAlexW1986309477MaRDI QIDQ686160FDOQ686160

Bogdan Oporowski

Publication date: 1 November 1993

Published in: Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0012-365x(93)90332-n

Recommendations

• Spanning trees of locally finite graphs
• scientific article; zbMATH DE number 3865323
• Decompositions of infinite graphs. I: Bond-faithful decompositions
• Decomposing infinite 2-connected graphs into 3-connected components
• An edge-deletion problem for locally finite graphs

zbMATH Keywords

decompositionlocally finite graph

Mathematics Subject Classification ID

Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)

Cites Work

• Wurzelbäume und unendliche Wege in Graphen
• Über unendliche Wege in Graphen

Cited In (14)

• Quasiray decomposition of infinite graphs
• Approximately uniformly locally finite graphs
• On decomposing graphs of large minimum degree into locally irregular subgraphs
• Finite locally-primitive complete bipartite graphs
• The structure of locally finite two-connected graphs
• Reconstruction of locally finite connected graphs with at least three infinite wings
• Decomposing Ends of Locally Finite Graphs
• Title not available (Why is that?)
• Decomposing degenerate graphs into locally irregular subgraphs
• Decomposing infinite 2-connected graphs into 3-connected components
• On the degrees of vertices in locally finite graphs which possess a certain edge deletion property
• An edge-deletion problem for locally finite graphs
• On degrees of vertices in paradoxical trees
• An existence theory for loopy graph decompositions

This page was built for publication: A decomposition of locally finite graphs

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