Strong cliques in diamond-free graphs (Q5919069): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Changed an Item
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Strong cliques and equistability of EPT graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: A characterization of claw-free CIS graphs and new results on the order of CIS graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4359594 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Not complementary connected and not CIS \(d\)-graphs form weakly monotone families / rank
 
Normal rank
Property / cites work
 
Property / cites work: On graphs whose maximal cliques and stable sets intersect / rank
 
Normal rank
Property / cites work
 
Property / cites work: On graphs with polynomially solvable maximum-weight clique problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Topics on perfect graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Efficiently decomposing, recognizing and triangulating hole-free graphs without diamonds / rank
 
Normal rank
Property / cites work
 
Property / cites work: Convex Bodies, Graphs and Partial Orders / rank
 
Normal rank
Property / cites work
 
Property / cites work: On CIS circulants / rank
 
Normal rank
Property / cites work
 
Property / cites work: On equistable, split, CIS, and related classes of graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Clique separator decomposition of hole-free and diamond-free graphs and algorithmic consequences / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3344031 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3820628 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Survey of the Algorithmic Properties of Simplicial, Upper Bound and Middle Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Strong cliques in diamond-free graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Erdös-Hajnal Conjecture-A Survey / rank
 
Normal rank
Property / cites work
 
Property / cites work: Obstructions for three-coloring graphs without induced paths on six vertices / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3139761 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Colouring diamond-free graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Proof of Chvátal's conjecture on maximal stable sets and maximal cliques in graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Vertex-transitive CIS graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Ramsey-type theorems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Graph-based data clustering with overlaps / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algorithmic graph theory and perfect graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Perfect Elimination and Chordal Bipartite Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: On exact blockers and anti-blockers, \(\varDelta \)-conjecture, and related problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5689002 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On a conjecture of Meyniel / rank
 
Normal rank
Property / cites work
 
Property / cites work: Efficient algorithms for minimum weighted colouring of some classes of perfect graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Classes of perfect graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Graphs vertex-partitionable into strong cliques / rank
 
Normal rank
Property / cites work
 
Property / cites work: Detecting strong cliques / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3558598 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the chromatic number of (\(P_6\), diamond)-free graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Graph-Theoretic Concepts in Computer Science / rank
 
Normal rank
Property / cites work
 
Property / cites work: Even-hole-free graphs that do not contain diamonds: A structure theorem and its consequences / rank
 
Normal rank
Property / cites work
 
Property / cites work: An Optimal Algorithm to Detect a Line Graph and Output Its Root Graph / rank
 
Normal rank
Property / cites work
 
Property / cites work: Equistable graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: A characterization and hereditary properties for partition graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Equistarable Graphs and Counterexamples to Three Conjectures on Equistable Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: A decomposition for strongly perfect graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: A class of threshold and domishold graphs: Equistable and equidominating graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4871056 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3701463 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A \(max \{m, n \}\) algorithm for determining the graph H from its line graph G / rank
 
Normal rank
Property / cites work
 
Property / cites work: Complexity results for well‐covered graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: An algorithm to recognize a middle graph / rank
 
Normal rank
Property / cites work
 
Property / cites work: Finding large holes / rank
 
Normal rank
Property / cites work
 
Property / cites work: Decomposition by clique separators / rank
 
Normal rank
Property / cites work
 
Property / cites work: A New Algorithm for Generating All the Maximal Independent Sets / rank
 
Normal rank
Property / cites work
 
Property / cites work: Coloring perfect \((K_ 4\)-e)-free graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: An algorithm for finding clique cut-sets / rank
 
Normal rank
Property / cites work
 
Property / cites work: Generalizations of Grillet's theorem on maximal stable sets and maximal cliques in graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Bipartite bihypergraphs: a survey and new results / rank
 
Normal rank

Latest revision as of 12:33, 24 July 2024

scientific article; zbMATH DE number 7305079
Language Label Description Also known as
English
Strong cliques in diamond-free graphs
scientific article; zbMATH DE number 7305079

    Statements

    Strong cliques in diamond-free graphs (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    3 February 2021
    0 references
    maximal clique
    0 references
    maximal stable set
    0 references
    diamond-free graph
    0 references
    strong clique
    0 references
    simplicial clique
    0 references
    strongly perfect graph
    0 references
    CIS graph
    0 references
    NP-hard problem
    0 references
    polynomial-time algorithm
    0 references
    Erdős-Hajnal property
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references

    Identifiers

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