Decompositions of infinite graphs. I: Bond-faithful decompositions
From MaRDI portal
Publication:2485948
Recommendations
Cites work
- Decomposition of Graphs Into Closed and Endless Chains
- Decomposition of infinite eulerian graphs with a small number of vertices of infinite degree
- scientific article; zbMATH DE number 3833989 (Why is no real title available?)
- scientific article; zbMATH DE number 4214053 (Why is no real title available?)
- scientific article; zbMATH DE number 3728302 (Why is no real title available?)
- Infinite Euler Graphs
Cited in
(16)- Decomposition of infinite eulerian graphs with a small number of vertices of infinite degree
- Decomposing infinite 2-connected graphs into 3-connected components
- A Cantor-Bernstein-type theorem for spanning trees in infinite graphs
- Elementary submodels in infinite combinatorics
- Decompositions of infinite graphs. II: Circuit decompositions
- scientific article; zbMATH DE number 3865323 (Why is no real title available?)
- Decomposition of an infinite complete graph into complete bipartite subgraphs
- scientific article; zbMATH DE number 15866 (Why is no real title available?)
- On decomposing a graph into nontrivial bonds
- scientific article; zbMATH DE number 940707 (Why is no real title available?)
- Disjoint dijoins for classes of dicuts in finite and infinite digraphs
- Orientations of infinite graphs with prescribed edge-connectivity
- A decomposition of locally finite graphs
- Limits of cycles and cover conjectures
- Circuit-partition of infinite matroids
- An extension of Sallee's theorem to infinite locally finite VAP-free plane graphs
This page was built for publication: Decompositions of infinite graphs. I: Bond-faithful decompositions
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2485948)