On deciding switching equivalence of graphs

DOI10.1016/0166-218X(80)90038-4MaRDI QIDQ1141663zbMATH OpenOpenAlexFDO

Authors Charles J. Colbourn, Derek G. 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)

Cites work

• scientific article; zbMATH DE number 3728314 (Why is no real title available?)
• scientific article; zbMATH DE number 3745240 (Why is no real title available?)
• scientific article; zbMATH DE number 3482386 (Why is no real title available?)
• scientific article; zbMATH DE number 3547309 (Why is no real title available?)
• scientific article; zbMATH DE number 3628390 (Why is no real title available?)
• Greedy Colourings of Steiner Triple Systems
• On the \(n\log{n}\) isomorphism technique (preliminary report)
• Two-Graphs, Switching Classes and Euler Graphs are Equal in Number

Cited in

(10)

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

This page was built for publication: On deciding switching equivalence of graphs

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