scientific article; zbMATH DE number 3683610

MaRDI QIDQ3879253zbMATH OpenFDO

Authors Rudolf Halin

Publication date 1980

zbMATH Keywords

coloring problemsinfinite graphsMenger's theoremrepresentations of graphstrees skeletons

Mathematics Subject Classification ID

Introductory exposition (textbooks, tutorial papers, etc.) pertaining to combinatorics (05-01) Trees (05C05) Coloring of graphs and hypergraphs (05C15) Paths and cycles (05C38) Connectivity (05C40) Graph theory (05Cxx)

Cited in

(5)

• Gruppenuniversalität und Homogenisierbarkeit
• Computing and interpreting the adjacency spectrum of traffic networks
• Disjunkte Fragmente in kritisch n-fach zusammenhängenden Graphen
• On the lattices of cutsets in finite graphs
• High connectivity keeping sets in graphs and digraphs

This page was built for publication:

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