The number of vertices of degree \(k\) in a minimally \(k\)-edge connected graph

DOI10.1006/jctb.1993.1039zbMath0738.05050OpenAlexW1988128001MaRDI QIDQ811560

Mao-cheng Cai

Publication date: 1992

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

Full work available at URL: https://doi.org/10.1006/jctb.1993.1039

zbMATH Keywords

minimally k-edge-connected simple graph

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Enumeration in graph theory (05C30) Connectivity (05C40)

Related Items

On Vertices of Degree n in Minimally n-Edge-Connected Graphs, Connectivity preserving trees in k‐connected or k‐edge‐connected graphs, Edges of degree \(k\) in minimally restricted \(k\)-edge connected graphs