Switchings Constrained to 2-Connectivity in Simple Graphs

DOI10.1137/0603011zbMath0499.05042OpenAlexW1973228796MaRDI QIDQ3964607

Richard Taylor

Publication date: 1982

Published in: SIAM Journal on Algebraic Discrete Methods (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1137/0603011

zbMATH Keywords

degree sequence2-connected graphssequence of switchings

Mathematics Subject Classification ID

Graph theory (05C99) Connectivity (05C40)

Related Items (8)

Making multigraphs simple by a sequence of double edge swaps ⋮ Constructing and sampling directed graphs with given degree sequences ⋮ Graphs and degree sequences. I ⋮ Exact sampling of graphs with prescribed degree correlations ⋮ The isolation game for regular graphs ⋮ An Ore-type condition for cyclability ⋮ On Ringeisen's isolation game ⋮ On Ringeisen's isolation game. II

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Switchings Constrained to 2-Connectivity in Simple Graphs