On deciding switching equivalence of graphs

DOI10.1016/0166-218X(80)90038-4zbMATH Open0438.05054OpenAlexW1966964529MaRDI QIDQ1141663FDOQ1141663

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

• On the n^{log n} isomorphism technique (A Preliminary Report)
• Two-Graphs, Switching Classes and Euler Graphs are Equal in Number
• Greedy Colourings of Steiner Triple Systems
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)

Cited In (10)

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

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)