On forcibly connected graphic sequences

DOI10.1016/0012-365X(91)90311-OMaRDI QIDQ1185077zbMATH OpenOpenAlexFDO

Authors S. 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

connectivitygraphic sequencesHamiltonian graph

Mathematics Subject Classification ID

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

Review text

Let \(p\) be a graph-theoretic property. A graphic sequence \(\pi: d_ 1\geq d_ 2\geq \dots\geq d_ p\) is forcibly \(p\) if every realization of \(\pi\) has property \(p\). The author gives a few sufficient conditions for a graphic sequence to be forcibly connected.

Recommendations

• scientific article; zbMATH DE number 932614
• A new sufficient degree condition for a graphic sequence to be forcibly \(k\)-edge-connected
• Forcibly bipartite and acyclic (uni-)graphic sequences
• Graph classes characterized both by forbidden subgraphs and degree sequences
• scientific article; zbMATH DE number 2192215

Cites work

• scientific article; zbMATH DE number 3743297 (Why is no real title available?)
• scientific article; zbMATH DE number 3758364 (Why is no real title available?)
• scientific article; zbMATH DE number 3489167 (Why is no real title available?)
• scientific article; zbMATH DE number 3575630 (Why is no real title available?)
• scientific article; zbMATH DE number 3293646 (Why is no real title available?)
• The strongest monotone degree condition for \(n\)-connectedness of a graph

Cited in

(18)

• Extremal problems on components and loops in graphs
• Adjacency relationships forced by a degree sequence
• Graphs G for which G and \(\bar G\) are both semidecomposable
• A strong Pósa condition for a graphic list to be forcibly \(Z_3\)-connected
• A new sufficient degree condition for a graphic sequence to be forcibly \(k\)-edge-connected
• Solution to a forcible version of a graphic sequence problem
• On forcibly \(k\)-connected and forcibly \(k\)-arc-connected digraphic sequences
• Independence number of graphs and line graphs of trees by means of omega invariant
• scientific article; zbMATH DE number 3922708 (Why is no real title available?)
• Graphic sequences with an \(A\)-connected realization
• scientific article; zbMATH DE number 932614 (Why is no real title available?)
• The effect of edge and vertex deletion on omega invariant
• Omega invariant of graphs and cyclicness
• Forcibly-biconnected Graphical Degree Sequences: Decision Algorithms and Enumerative Results
• An Efficient Algorithm to Test Forcibly-connectedness of Graphical Degree Sequences
• On \(\mathfrak A(R,S)\) all of whose members are indecomposable
• Forcibly bipartite and acyclic (uni-)graphic sequences
• Forcibly unicyclic and bicyclic graphic sequences

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1185077)