Construction of a Maximally Edge-Connected Graph with Prescribed Degrees

DOI10.1002/SAPM197655187zbMATH Open0328.05125OpenAlexW2605717661MaRDI QIDQ4093476FDOQ4093476

Authors:

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)

Cites Work

• Existence of k-edge connected ordinary graphs with prescribed degrees
• Minimal Number of Multiple Edges in Realization of an Incidence Sequence Without Loops
• Existence of triconnected graphs with prescribed degrees
• Title not available (Why is that?)

Cited In (2)

• On the existence of super edge-connected graphs with prescribed degrees
• Characterization of digraphic sequences with strongly connected realizations

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

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