The strongest monotone degree condition for \(n\)-connectedness of a graph
From MaRDI portal
Publication:2560834
DOI10.1016/0095-8956(74)90058-6zbMath0262.05122OpenAlexW1981678905MaRDI QIDQ2560834
Publication date: 1974
Published in: Journal of Combinatorial Theory. Series B (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0095-8956(74)90058-6
Extremal problems in graph theory (05C35) Reliability, availability, maintenance, inspection in operations research (90B25)
Related Items
Stability theorems for graph vulnerability parameters, On forcibly \(k\)-connected and forcibly \(k\)-arc-connected digraphic sequences, Best monotone degree condition for the Hamiltonicity of graphs with a 2-factor, Degree sequences and edge connectivity, Best monotone degree conditions for binding number, Best monotone degree conditions for graph properties: a survey, On forcibly connected graphic sequences, Best monotone degree conditions for binding number and cycle structure, Toughness and Vertex Degrees, Sufficient degree conditions fork-edge-connectedness of a graph, On the necessity of Chvátal’s Hamiltonian degree condition, A new sufficient degree condition for a graphic sequence to be forcibly \(k\)-edge-connected
Cites Work