Switchings Constrained to 2-Connectivity in Simple Graphs

DOI10.1137/0603011MaRDI QIDQ3964607zbMATH OpenOpenAlexFDO

Authors 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

2-connected graphsdegree sequencesequence of switchings

Mathematics Subject Classification ID

Connectivity (05C40) Graph theory (05C99)

Cites work

• Graph theory with applications
• scientific article; zbMATH DE number 3661368 (Why is no real title available?)
• scientific article; zbMATH DE number 3760216 (Why is no real title available?)
• scientific article; zbMATH DE number 3290993 (Why is no real title available?)

Cited in

(8)

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

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

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