Transforming Graphs with the Same Degree Sequence

DOI10.1007/978-3-540-89550-3_3MaRDI QIDQ5302735zbMATH OpenOpenAlexFDO

Authors Sergey Bereg, Hiro Ito

Publication date 13 January 2009

Published in Computational Geometry and Graph Theory (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-540-89550-3_3

Mathematics Subject Classification ID

Vertex degrees (05C07)

Recommendations

• scientific article; zbMATH DE number 7535774
• Switching Distance Between Graphs with the Same Degrees
• On certain trees with the same degree sequence
• A family of switch equivalent graphs
• Graphs with given odd sets

Cites work

• scientific article; zbMATH DE number 3338381 (Why is no real title available?)
• On Realizability of a Set of Integers as Degrees of the Vertices of a Linear Graph. I

Cited in

(7)

• Approximating shortest connected graph transformation for trees
• Impossibility of Transformation of Vertex Labeled Simple Graphs Preserving the Cut-Size Order
• On 2-switches and isomorphism classes
• Switching Distance Between Graphs with the Same Degrees
• Graphs with given odd sets
• On the longest flip sequence to untangle segments in the plane
• Short flip sequences to untangle segments in the plane

This page was built for publication: Transforming Graphs with the Same Degree Sequence

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