Impossibility of Transformation of Vertex Labeled Simple Graphs Preserving the Cut-Size Order

DOI10.1007/978-3-540-70666-3_7zbMATH Open1149.05318OpenAlexW1490068339MaRDI QIDQ3595418FDOQ3595418

Authors: Hiro Ito 

Publication date: 28 August 2007

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

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

Recommendations

• Three Equivalent Partial Orders on Graphs with Real Edge-Weights Drawn on a Convex Polygon
• Graphs with given odd sets
• scientific article; zbMATH DE number 863637
• Results and problems concerning edge transformed graphs
• Transforming Graphs with the Same Degree Sequence

Mathematics Subject Classification ID

Connectivity (05C40)

Cited In (2)

• Three Equivalent Partial Orders on Graphs with Real Edge-Weights Drawn on a Convex Polygon
• Order Reconfiguration under Width Constraints

This page was built for publication: Impossibility of Transformation of Vertex Labeled Simple Graphs Preserving the Cut-Size Order

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