Non--critical vertices in graphs

DOI10.1016/0012-365X(83)90009-2MaRDI QIDQ795056zbMATH OpenFDO

Authors Henk Jan Veldman

Publication date 1983

Published in Discrete Mathematics (Search for Journal in Brave)

zbMATH Keywords

critically connectednoncritical vertices

Mathematics Subject Classification ID

Connectivity (05C40)

Recommendations

• The vertices of lower degree in contraction-critical \(\kappa \)-connected graphs.
• On degrees of vertices in critically \(k\)-connected graphs
• scientific article; zbMATH DE number 3983211
• scientific article; zbMATH DE number 68915
• Critically (k,k)-connected graphs

Cites work

• Critically n-Connected Graphs
• On critically h-connected simple graphs
• Parallel concepts in graph theory

Cited in

(7)

• Every DFS Tree of a 3‐Connected Graph Contains a Contractible Edge
• On critical 3-connected graphs with two vertices of degree 3. I
• Vertices of small degree in critically \(n\)-connected digraphs
• On maximum critically h-connected graphs
• On the number of noncritical vertices in strongly connected digraphs
• Disjunkte Fragmente in kritisch n-fach zusammenhängenden Graphen
• On critical 3-connected graphs with two vertices of degree 3. II

This page was built for publication: Non-\(\kappa\)-critical vertices in graphs

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