Decompositions of infinite graphs. I: Bond-faithful decompositions

DOI10.1016/j.jctb.2005.01.003zbMath1066.05113OpenAlexW2021615485MaRDI QIDQ2485948

François Laviolette

Publication date: 5 August 2005

Published in: Journal of Combinatorial Theory. Series B (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.jctb.2005.01.003

zbMATH Keywords

Connectivity

Mathematics Subject Classification ID

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

Related Items (5)

Disjoint dijoins for classes of dicuts in finite and infinite digraphs ⋮ An extension of Sallee's theorem to infinite locally finite VAP-free plane graphs ⋮ Elementary submodels in infinite combinatorics ⋮ Orientations of infinite graphs with prescribed edge-connectivity ⋮ A Cantor-Bernstein-type theorem for spanning trees in infinite graphs

Cites Work

• Decomposition of infinite eulerian graphs with a small number of vertices of infinite degree
• Decomposition of Graphs Into Closed and Endless Chains
• Infinite Euler Graphs
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Decompositions of infinite graphs. I: Bond-faithful decompositions