Construction of a Maximally Edge-Connected Graph with Prescribed Degrees

DOI10.1002/sapm197655187zbMath0328.05125OpenAlexW2605717661MaRDI QIDQ4093476

No author found.

Publication date: 1976

Published in: Studies in Applied Mathematics (Search for Journal in Brave)

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

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Graph theory (05C99)

Related Items (2)

Characterization of Digraphic Sequences with Strongly Connected Realizations ⋮ On the existence of super edge-connected graphs with prescribed degrees

Cites Work

• Unnamed Item
• Existence of triconnected graphs with prescribed degrees
• Minimal Number of Multiple Edges in Realization of an Incidence Sequence Without Loops
• Existence of k-edge connected ordinary graphs with prescribed degrees

This page was built for publication: Construction of a Maximally Edge-Connected Graph with Prescribed Degrees