Induced minor free graphs: isomorphism and clique-width (Q1702118): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Changed an Item
ReferenceBot (talk | contribs)
Changed an Item
 
(3 intermediate revisions by 2 users not shown)
aliases / en / 0aliases / en / 0
 
Induced Minor Free Graphs: Isomorphism and Clique-width
description / endescription / en
scientific article
scientific article; zbMATH DE number 6642020
Property / title
 
Induced Minor Free Graphs: Isomorphism and Clique-width (English)
Property / title: Induced Minor Free Graphs: Isomorphism and Clique-width (English) / rank
 
Normal rank
Property / zbMATH Open document ID
 
Property / zbMATH Open document ID: 1417.05196 / rank
 
Normal rank
Property / DOI
 
Property / DOI: 10.1007/978-3-662-53174-7_21 / rank
 
Normal rank
Property / published in
 
Property / published in: Graph-Theoretic Concepts in Computer Science / rank
 
Normal rank
Property / publication date
 
21 October 2016
Timestamp+2016-10-21T00:00:00Z
Timezone+00:00
CalendarGregorian
Precision1 day
Before0
After0
Property / publication date: 21 October 2016 / rank
 
Normal rank
Property / zbMATH DE Number
 
Property / zbMATH DE Number: 6642020 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2403754969 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4425939 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the Relationship Between Clique-Width and Treewidth / rank
 
Normal rank
Property / cites work
 
Property / cites work: Clique-width and edge contraction / rank
 
Normal rank
Property / cites work
 
Property / cites work: Linear time solvable optimization problems on graphs of bounded clique-width / rank
 
Normal rank
Property / cites work
 
Property / cites work: Upper bounds to the clique width of graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Classifying the Clique-Width of H-Free Bipartite Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Clique-Width of Graph Classes Defined by Two Forbidden Induced Subgraphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5315023 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Structure theorem and isomorphism test for graphs with excluded topological subgraphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3875946 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Recent developments on graphs of bounded clique-width / rank
 
Normal rank
Property / cites work
 
Property / cites work: Isomorphism for Graphs of Bounded Feedback Vertex Set Number / rank
 
Normal rank
Property / cites work
 
Property / cites work: Graph Isomorphism for Graph Classes Characterized by Two Forbidden Induced Subgraphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fixed-Parameter Tractable Canonization and Isomorphism Test for Graphs of Bounded Treewidth / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the Band-, Tree-, and Clique-Width of Graphs with Bounded Vertex Degree / rank
 
Normal rank
Property / cites work
 
Property / cites work: Isomorphism on Subgraph-Closed Graph Classes: A Complexity Dichotomy and Intermediate Graph Classes / rank
 
Normal rank
Property / cites work
 
Property / cites work: Reduction Techniques for Graph Isomorphism in the Context of Width Parameters / rank
 
Normal rank
Property / cites work
 
Property / cites work: Rank-width and vertex-minors / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximating clique-width and branch-width / rank
 
Normal rank
Property / cites work
 
Property / cites work: The isomorphism problem for classes of graphs closed under contraction / rank
 
Normal rank
Property / cites work
 
Property / cites work: Towards an Isomorphism Dichotomy for Hereditary Graph Classes / rank
 
Normal rank
Property / cites work
 
Property / cites work: On graph contractions and induced minors / rank
 
Normal rank
Property / cites work
 
Property / cites work: Graph isomorphism in quasipolynomial time [extended abstract] / rank
 
Normal rank
Property / cites work
 
Property / cites work: Induced minors and well-quasi-ordering / rank
 
Normal rank
Property / cites work
 
Property / cites work: On testing isomorphism of permutation graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Classifying the clique-width of \(H\)-free bipartite graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: The complexity of induced minors and related problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Contraction Bidimensionality: The Accurate Picture / rank
 
Normal rank
Property / cites work
 
Property / cites work: ON THE CLIQUE-WIDTH OF SOME PERFECT GRAPH CLASSES / rank
 
Normal rank
Property / cites work
 
Property / cites work: Structure Theorem and Isomorphism Test for Graphs with Excluded Topological Subgraphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Linear Time Algorithm for Deciding Interval Graph Isomorphism / rank
 
Normal rank
Property / cites work
 
Property / cites work: Graph isomorphism is in the low hierarchy / rank
 
Normal rank

Latest revision as of 06:29, 15 July 2024

scientific article; zbMATH DE number 6642020
  • Induced Minor Free Graphs: Isomorphism and Clique-width
Language Label Description Also known as
English
Induced minor free graphs: isomorphism and clique-width
scientific article; zbMATH DE number 6642020
  • Induced Minor Free Graphs: Isomorphism and Clique-width

Statements

Induced minor free graphs: isomorphism and clique-width (English)
0 references
Induced Minor Free Graphs: Isomorphism and Clique-width (English)
0 references
0 references
0 references
0 references
28 February 2018
0 references
21 October 2016
0 references
induced minor
0 references
graph isomorphism
0 references
clique-width
0 references
0 references
0 references
0 references

Identifiers

0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references