Minimally n-line connected graphs.

DOI10.1515/crll.1972.252.178zbMath0233.05118OpenAlexW132749166MaRDI QIDQ5641175

Don R. Lick

Publication date: 1972

Published in: Journal für die reine und angewandte Mathematik (Crelles Journal) (Search for Journal in Brave)

Full work available at URL: https://www.digizeitschriften.de/dms/resolveppn/?PPN=GDZPPN002186543

Mathematics Subject Classification ID

Connectivity (05C40)

Related Items

On edge-path eigenvalues of graphs, Globally rigid powers of graphs, Unnamed Item, Connectivity preserving trees in k‐connected or k‐edge‐connected graphs, Critical vertices in \(k\)-connected digraphs, Connectivity keeping edges of trees in 3-connected or 3-edge-connected graphs, A remark on the number of vertices of degree \(k\) in a minimally \(k\)-edge- connected graph, Extremal infinite graph theory, Sparse graph certificates for mixed connectivity, On k-minimally n-edge-connected graphs, Ecken vom Innen- und Außengrad \(n\) in minimal \(n\)-fach kantenzusammenhängenden Digraphen, Kantendisjunkte Wege in Graphen, Kritisch n-fach kantenzusammenhängende Graphen. (Critically n-edge- connected graphs)