On Switching to <i>H</i>‐Free Graphs (Q5417832): Difference between revisions
From MaRDI portal
Set OpenAlex properties. |
Normalize DOI. |
||
(One intermediate revision by one other user not shown) | |||
Property / DOI | |||
Property / DOI: 10.1002/jgt.21745 / rank | |||
Property / cites work | |||
Property / cites work: The bi-join decomposition / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Pancyclicity in switching classes / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q4198056 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: A Characterization of Acyclic Switching Classes of Graphs Using Forbidden Subgraphs / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Recognizing \(P_ 3\)-structure: A switching approach / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: On perfect switching classes / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q3035339 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Graph-Theoretic Concepts in Computer Science / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Circular permutation graphs / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q4065580 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q4121914 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: A linear time algorithm to recognize circular permutation graphs / rank | |||
Normal rank | |||
Property / DOI | |||
Property / DOI: 10.1002/JGT.21745 / rank | |||
Normal rank |
Latest revision as of 16:57, 30 December 2024
scientific article; zbMATH DE number 6297913
Language | Label | Description | Also known as |
---|---|---|---|
English | On Switching to <i>H</i>‐Free Graphs |
scientific article; zbMATH DE number 6297913 |
Statements
On Switching to <i>H</i>‐Free Graphs (English)
0 references
22 May 2014
0 references
Seidel's switching
0 references
computational complexity
0 references
\(H\)-free graphs
0 references