On the existence of N‐connected graphs with prescribed degrees (n ≧ 2)

DOI10.1002/NET.3230030303zbMATH Open0258.05130OpenAlexW2086864954MaRDI QIDQ5672673

Author name not available (Why is that?)

Publication date: 1973

Published in: Networks (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1002/net.3230030303

Mathematics Subject Classification ID

Graph theory (05C99) Software, source code, etc. for problems pertaining to combinatorics (05-04)

Cites Work

• Existence of triconnected graphs with prescribed degrees
• Existence of k-edge connected ordinary graphs with prescribed degrees

Related Items (17)

Arranging apples in an array ⋮ Extensions de réseaux de connexité donnée. (Extensions of graphs of given connectivity) ⋮ Graph realizations: maximum degree in vertex neighborhoods ⋮ Title not available (Why is that?) ⋮ Efficient counting of degree sequences ⋮ On the existence of super edge-connected graphs with prescribed degrees ⋮ Efficiently Realizing Interval Sequences ⋮ Algorithms ⋮ Integral matrices with given row and column sums ⋮ The degree sequences of self-complementary graphs ⋮ Steiner diameter, maximum degree and size of a graph ⋮ Composed degree-distance realizations of graphs ⋮ Zur Struktur minimal n-fach zusammenhängender Graphen ⋮ Composed degree-distance realizations of graphs ⋮ Supermodularity in Unweighted Graph Optimization III: Highly Connected Digraphs ⋮ On forcibly hereditary P-graphical sequences ⋮ The strongest monotone degree condition for \(n\)-connectedness of a graph

This page was built for publication: On the existence of N‐connected graphs with prescribed degrees (n ≧ 2)

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