The countable character of uncountable graphs

MaRDI QIDQ2844077zbMATH OpenFDO

Authors François Laviolette

Publication date 27 August 2013

Full work available at URL http://www.sciencedirect.com/science/article/pii/S1571066104051370

zbMATH Keywords

decomposition of graphsedge separationsedge-connectivitiesedge-disjoint subgraphs of countable cardinality

Mathematics Subject Classification ID

Connectivity (05C40) Infinite graphs (05C63) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)

Recommendations

• Hadwiger's conjecture for uncountable graphs
• Uncountable graphs and invariant measures on the set of universal countable graphs
• A note on uncountable chordal graphs
• On the existence of countable universal graphs
• Hedetniemi's conjecture for uncountable graphs
• On the order of countable graphs
• On immersions of uncountable graphs
• The group of the countable universal graph
• The Lovász-Cherkassky theorem in countable graphs
• A characterization of a topology on the countably infinite random graph

Cited in

(7)

• Hadwiger's conjecture for uncountable graphs
• Decompositions of infinite graphs. I: Bond-faithful decompositions
• Countable splitting graphs
• A note on minors of uncountable graphs
• scientific article; zbMATH DE number 940707 (Why is no real title available?)
• Uncountable transfinite graphs and electrical networks
• Countable \(\alpha\)-extendable graphs

This page was built for publication: The countable character of uncountable graphs

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