Switching classes: characterization and computation

Cites work

scientific article; zbMATH DE number 3865318 (Why is no real title available?)
scientific article; zbMATH DE number 125469 (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 1504827 (Why is no real title available?)
scientific article; zbMATH DE number 2097774 (Why is no real title available?)
scientific article; zbMATH DE number 3225111 (Why is no real title available?)
A Characterization of Acyclic Switching Classes of Graphs Using Forbidden Subgraphs
Acyclicity of switching classes
An extremal function for contractions of graphs
Characterizations of derived graphs
Cohomological aspects of two-graphs
Graph modification for edge-coloured and signed graph homomorphism problems: parameterized and classical complexity
Lower bound of the Hadwiger number of graphs by their average degree
On Switching to H‐Free Graphs
On deciding switching equivalence of graphs
On perfect switching classes
On subgraph complementation to \(H\)-free Graphs
On switching classes, NLC-width, cliquewidth and treewidth
Parameterized algorithms
Parameterized problems related to Seidel's switching
Paw-free graphs
Rainbow graphs and switching classes
Rank-width and vertex-minors
Recognizing \(P_ 3\)-structure: A switching approach
Reconstruction from vertex-switching
Switching classes of directed graphs
Switching reconstruction of digraphs
The extremal function for complete minors
Two-Graphs, Switching Classes and Euler Graphs are Equal in Number
Vertex-switching reconstruction of subgraph numbers and triangle-free graphs

This page was built for publication: Switching classes: characterization and computation

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