On equistable, split, CIS, and related classes of graphs (Q344829): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
ReferenceBot (talk | contribs)
Changed an Item
 
(3 intermediate revisions by 3 users not shown)
Property / OpenAlex ID
 
Property / OpenAlex ID: W2119925787 / rank
 
Normal rank
Property / Wikidata QID
 
Property / Wikidata QID: Q59560467 / rank
 
Normal rank
Property / arXiv ID
 
Property / arXiv ID: 1505.05683 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4359594 / 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: Not complementary connected and not CIS \(d\)-graphs form weakly monotone families / rank
 
Normal rank
Property / cites work
 
Property / cites work: Stochastic graphs and strongly perfect graphs - a survey / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Normal Graph Conjecture for Classes of Sparse Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: On CIS circulants / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3614023 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Partitions of graphs into one or two independent sets and cliques / rank
 
Normal rank
Property / cites work
 
Property / cites work: Cycle transversals in perfect graphs and cographs / rank
 
Normal rank
Property / cites work
 
Property / cites work: On stable cutsets in graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Bisplit graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Graph Classes: A Survey / rank
 
Normal rank
Property / cites work
 
Property / cites work: The complexity of some problems related to GRAPH 3-COLORABILITY / 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: Q4165164 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Entropy splitting for antiblocking corners and perfect graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the odd cycles of normal graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Recent examples in the theory of partition graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3801594 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3472142 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4204182 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3767384 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Partitioning graphs into complete and empty graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Cross‐intersecting couples of graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Split Graphs Having Dilworth Number Two / rank
 
Normal rank
Property / cites work
 
Property / cites work: Faster scaling algorithms for general graph matching problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Decomposing complete edge-chromatic graphs and hypergraphs. Revisited / 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: Efficient algorithms for minimum weighted colouring of some classes of perfect graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: A note on the computational complexity of graph vertex partition / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5683869 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Vertex-transitive CIS 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: Equistable series-parallel graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Equistable distance-hereditary graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4777339 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Two-step encoding for finite sources / rank
 
Normal rank
Property / cites work
 
Property / cites work: Graphs that Split Entropies / rank
 
Normal rank
Property / cites work
 
Property / cites work: Equistable simplicial, very well-covered, and line graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Threshold graphs and related topics / 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: Q3039403 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Equistable graphs, general partition graphs, triangle graphs, and graph products / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the complexity of the independent set problem in triangle graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Independent Domination in Triangle Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Line-graphs of cubic graphs are normal / 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: Equistable chordal graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Some covering concepts in graphs / 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: Q3424793 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Constructions for normal graphs and some consequences / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Characterization of Almost CIS Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Partition the vertices of a graph into one independent set and one acyclic set / 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 00:33, 13 July 2024

scientific article
Language Label Description Also known as
English
On equistable, split, CIS, and related classes of graphs
scientific article

    Statements

    On equistable, split, CIS, and related classes of graphs (English)
    0 references
    0 references
    0 references
    0 references
    24 November 2016
    0 references
    0 references
    0 references
    0 references
    0 references
    clique
    0 references
    stable set
    0 references
    CIS graph
    0 references
    equistable graph
    0 references
    split graph
    0 references
    triangle condition
    0 references
    general partition graph
    0 references
    edge simplicial graph
    0 references
    upper bound graph
    0 references
    normal graph
    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
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references