On deciding switching equivalence of graphs

DOI10.1016/0166-218X(80)90038-4zbMath0438.05054OpenAlexW1966964529MaRDI QIDQ1141663

Charles J. Colbourn, Derek Gordon Corneil

Publication date: 1980

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

Full work available at URL: https://doi.org/10.1016/0166-218x(80)90038-4

zbMATH Keywords

isomorphism of graphsswitching equivalent graphs

Mathematics Subject Classification ID

Structural characterization of families of graphs (05C75) Graph theory (05C99)

Related Items

Switching codes and designs ⋮ The behavior of clique-width under graph operations and graph transformations ⋮ The isolation game for regular graphs ⋮ On perfect switching classes ⋮ An Ore-type condition for cyclability ⋮ Two-colorable graph states with maximal Schmidt measure ⋮ On Ringeisen's isolation game ⋮ On perfect switching classes ⋮ Graph isomorphism problem ⋮ On Ringeisen's isolation game. II

Cites Work

• Greedy Colourings of Steiner Triple Systems
• Two-Graphs, Switching Classes and Euler Graphs are Equal in Number
• On the n^{log n} isomorphism technique (A Preliminary Report)
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item