A family of switch equivalent graphs

DOI10.1016/j.disc.2004.09.001zbMath1058.05051OpenAlexW2079989676MaRDI QIDQ704278

Prasad Tetali, Dhruv Mubayi, Guenin, Bertrand

Publication date: 13 January 2005

Published in: Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.disc.2004.09.001

zbMATH Keywords

2-switchesDegree sequencesGraph transformationsOdd sets

Mathematics Subject Classification ID

Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Vertex degrees (05C07)

Cites Work

• Unnamed Item
• A remark on the existence of finite graphs
• On Realizability of a Set of Integers as Degrees of the Vertices of a Linear Graph. I
• A degree sequence problem related to network design
• Graphs with given odd sets

This page was built for publication: A family of switch equivalent graphs