On forcibly connected graphic sequences

DOI10.1016/0012-365X(91)90311-OzbMath0752.05048OpenAlexW1983987289MaRDI QIDQ1185077

Sheshayya A. Choudum

Publication date: 28 June 1992

Published in: Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0012-365x(91)90311-o

zbMATH Keywords

connectivityHamiltonian graphgraphic sequences

Mathematics Subject Classification ID

Special sequences and polynomials (11B83) Graph theory (05C99) Connectivity (05C40) Eulerian and Hamiltonian graphs (05C45)

Related Items (6)

Unnamed Item ⋮ Independence number of graphs and line graphs of trees by means of omega invariant ⋮ Forcibly bipartite and acyclic (uni-)graphic sequences ⋮ Extremal problems on components and loops in graphs ⋮ On \(\mathfrak A(R,S)\) all of whose members are indecomposable ⋮ The effect of edge and vertex deletion on omega invariant

Cites Work

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

This page was built for publication: On forcibly connected graphic sequences