A characterization of claw-free CIS graphs and new results on the order of CIS graphs
From MaRDI portal
Publication:2132328
DOI10.1016/j.entcs.2019.08.003OpenAlexW2978720059WikidataQ113317430 ScholiaQ113317430MaRDI QIDQ2132328
Marisa Gutierrez, Liliana Alcón, Martin Milanič
Publication date: 27 April 2022
Full work available at URL: https://arxiv.org/abs/1812.05314
claw-free graphmaximal stable setmaximal cliquemaximal independent setCIS graphrandomly internally matchable graph
Related Items
Cites Work
- Unnamed Item
- Equistarable bipartite graphs
- On equistable, split, CIS, and related classes of graphs
- On CIS circulants
- Vertex-transitive CIS graphs
- Proof of Chvátal's conjecture on maximal stable sets and maximal cliques in graphs
- Ramsey-type theorems
- Not complementary connected and not CIS \(d\)-graphs form weakly monotone families
- Decomposing complete edge-chromatic graphs and hypergraphs. Revisited
- Proof of Ding's conjecture on maximal stable sets and maximal cliques in planar graphs
- Complement reducible graphs
- A structure theorem for maximum internal matchings in graphs
- Graphs vertex-partitionable into strong cliques
- Generalizations of Grillet's theorem on maximal stable sets and maximal cliques in graphs
- On graphs whose maximal cliques and stable sets intersect
- Tutte type theorems for graphs having a perfect internal matching
- Bipartite bihypergraphs: a survey and new results
- A characterization of perfect graphs
- The Erdös-Hajnal Conjecture-A Survey
- Equistarable Graphs and Counterexamples to Three Conjectures on Equistable Graphs
- Deciding the deterministic property for soliton graphs
- Randomly matchable graphs
- Line Graphs of Helly Hypergraphs
- The Ramsey number R(3, t) has order of magnitude t2/log t
- A polynomial algorithm to find an independent set of maximum weight in a fork-free graph
