Component order connectivity and vertex degrees

MaRDI QIDQ5252055zbMATH OpenFDO

Authors M. Yatauro

Publication date 21 May 2015

zbMATH Keywords

degree sequence of a graph

Mathematics Subject Classification ID

Vertex degrees (05C07) Connectivity (05C40) Graph algorithms (graph-theoretic aspects) (05C85)

Recommendations

• Realizability results involving two connectivity parameters.
• Degree sum condition for \(k\)-ordered Hamiltonian connected graphs
• Degree sequences and edge connectivity
• Component order edge connectivity for graphs of fixed size and order.
• scientific article; zbMATH DE number 5036076

Cited in

(3)

• Degree sequences and edge connectivity
• scientific article; zbMATH DE number 4097423 (Why is no real title available?)
• Fundamental problems on bounded-treewidth graphs: the real source of hardness

This page was built for publication: Component order connectivity and vertex degrees

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