The strongest monotone degree condition for \(n\)-connectedness of a graph

DOI10.1016/0095-8956(74)90058-6zbMath0262.05122MaRDI QIDQ2560834

Yanyan Li

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

Mathematics Subject Classification ID

05C35: Extremal problems in graph theory

90B25: Reliability, availability, maintenance, inspection in operations research

Related Items

Toughness and Vertex Degrees, On the necessity of Chvátal’s Hamiltonian degree condition, Best monotone degree conditions for graph properties: a survey, Best monotone degree conditions for binding number and cycle structure, Best monotone degree conditions for binding number, On forcibly connected graphic sequences, Best monotone degree condition for the Hamiltonicity of graphs with a 2-factor, Degree sequences and edge connectivity, A new sufficient degree condition for a graphic sequence to be forcibly \(k\)-edge-connected, On forcibly \(k\)-connected and forcibly \(k\)-arc-connected digraphic sequences, Stability theorems for graph vulnerability parameters, Sufficient degree conditions fork-edge-connectedness of a graph

Cites Work

• Unnamed Item
• Unnamed Item
• Existence of triconnected graphs with prescribed degrees
• On Hamilton's ideals
• A sufficient condition for n ‐connectedness of graphs
• On the Existence of Graphs with Prescribed Degrees and Connectivity
• On the existence of N‐connected graphs with prescribed degrees (n ≧ 2)