Chordal co-gem-free and (\(P_{5}\),\,gem)-free graphs have bounded clique-width (Q1764808): Difference between revisions

From MaRDI portal
Import241208061232 (talk | contribs)
Normalize DOI.
Import recommendations run Q6767936
Property / Recommended article
 
Property / Recommended article: GEM- AND CO-GEM-FREE GRAPHS HAVE BOUNDED CLIQUE-WIDTH / rank
 
Normal rank
Property / Recommended article: GEM- AND CO-GEM-FREE GRAPHS HAVE BOUNDED CLIQUE-WIDTH / qualifier
 
Similarity Score: 0.9280738
Amount0.9280738
Unit1
Property / Recommended article: GEM- AND CO-GEM-FREE GRAPHS HAVE BOUNDED CLIQUE-WIDTH / qualifier
 
Property / Recommended article
 
Property / Recommended article: A BOUND FOR THE CHROMATIC NUMBER OF (, GEM)-FREE GRAPHS / rank
 
Normal rank
Property / Recommended article: A BOUND FOR THE CHROMATIC NUMBER OF (, GEM)-FREE GRAPHS / qualifier
 
Similarity Score: 0.8927191
Amount0.8927191
Unit1
Property / Recommended article: A BOUND FOR THE CHROMATIC NUMBER OF (, GEM)-FREE GRAPHS / qualifier
 
Property / Recommended article
 
Property / Recommended article: Bounding the Clique-Width of H-free Chordal Graphs / rank
 
Normal rank
Property / Recommended article: Bounding the Clique-Width of H-free Chordal Graphs / qualifier
 
Similarity Score: 0.88312846
Amount0.88312846
Unit1
Property / Recommended article: Bounding the Clique-Width of H-free Chordal Graphs / qualifier
 
Property / Recommended article
 
Property / Recommended article: Bounding the Clique‐Width of <i>H</i>‐Free Chordal Graphs / rank
 
Normal rank
Property / Recommended article: Bounding the Clique‐Width of <i>H</i>‐Free Chordal Graphs / qualifier
 
Similarity Score: 0.88312835
Amount0.88312835
Unit1
Property / Recommended article: Bounding the Clique‐Width of <i>H</i>‐Free Chordal Graphs / qualifier
 
Property / Recommended article
 
Property / Recommended article: On the structure of (\(P_{5}\),\,gem)-free graphs / rank
 
Normal rank
Property / Recommended article: On the structure of (\(P_{5}\),\,gem)-free graphs / qualifier
 
Similarity Score: 0.8750223
Amount0.8750223
Unit1
Property / Recommended article: On the structure of (\(P_{5}\),\,gem)-free graphs / qualifier
 
Property / Recommended article
 
Property / Recommended article: Stable set and clique polytopes of \((P_{5},\,\mathrm{gem})\)-free graphs / rank
 
Normal rank
Property / Recommended article: Stable set and clique polytopes of \((P_{5},\,\mathrm{gem})\)-free graphs / qualifier
 
Similarity Score: 0.86187065
Amount0.86187065
Unit1
Property / Recommended article: Stable set and clique polytopes of \((P_{5},\,\mathrm{gem})\)-free graphs / qualifier
 
Property / Recommended article
 
Property / Recommended article: Chordal bipartite graphs of bounded tree- and clique-width / rank
 
Normal rank
Property / Recommended article: Chordal bipartite graphs of bounded tree- and clique-width / qualifier
 
Similarity Score: 0.8599687
Amount0.8599687
Unit1
Property / Recommended article: Chordal bipartite graphs of bounded tree- and clique-width / qualifier
 
Property / Recommended article
 
Property / Recommended article: On algorithms for (\(P_5\), gem)-free graphs / rank
 
Normal rank
Property / Recommended article: On algorithms for (\(P_5\), gem)-free graphs / qualifier
 
Similarity Score: 0.85944664
Amount0.85944664
Unit1
Property / Recommended article: On algorithms for (\(P_5\), gem)-free graphs / qualifier
 
Property / Recommended article
 
Property / Recommended article: A refinement on the structure of vertex-critical \((P_5, \mathrm{gem})\)-free graphs / rank
 
Normal rank
Property / Recommended article: A refinement on the structure of vertex-critical \((P_5, \mathrm{gem})\)-free graphs / qualifier
 
Similarity Score: 0.8539583
Amount0.8539583
Unit1
Property / Recommended article: A refinement on the structure of vertex-critical \((P_5, \mathrm{gem})\)-free graphs / qualifier
 
Property / Recommended article
 
Property / Recommended article: Q5000997 / rank
 
Normal rank
Property / Recommended article: Q5000997 / qualifier
 
Similarity Score: 0.84818906
Amount0.84818906
Unit1
Property / Recommended article: Q5000997 / qualifier
 

Revision as of 17:23, 18 April 2025

scientific article
Language Label Description Also known as
English
Chordal co-gem-free and (\(P_{5}\),\,gem)-free graphs have bounded clique-width
scientific article

    Statements

    Chordal co-gem-free and (\(P_{5}\),\,gem)-free graphs have bounded clique-width (English)
    0 references
    0 references
    0 references
    0 references
    22 February 2005
    0 references

    Identifiers