On CIS circulants

DOI10.1016/j.disc.2013.11.015zbMath1281.05073arXiv1302.3498OpenAlexW1991141726WikidataQ59560493 ScholiaQ59560493MaRDI QIDQ394314

Endre Boros, Martin Milanič, Vladimir A. Gurvich

Publication date: 27 January 2014

Published in: Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1302.3498

zbMATH Keywords

maximal stable setmaximum cliquemaximal cliquewell-covered graphcirculantmaximum stable setCIS graph

Mathematics Subject Classification ID

Graphs and abstract algebra (groups, rings, fields, etc.) (05C25)

Related Items (15)

A large class of graphs with a small subclass of Cohen–Macaulay members ⋮ A characterization of claw-free CIS graphs and new results on the order of CIS graphs ⋮ On equistable, split, CIS, and related classes of graphs ⋮ Recognizing generating subgraphs in graphs without cycles of lengths 6 and 7 ⋮ Strong cliques in vertex‐transitive graphs ⋮ Graphs vertex-partitionable into strong cliques ⋮ Vertex-transitive CIS graphs ⋮ On Minkowski space and finite geometry ⋮ Independence Complexes of Well-Covered Circulant Graphs ⋮ Cohen-Macaulayness of two classes of circulant graphs ⋮ Sandwich problem for \(\varPi\)- and \(\varDelta\)-free multigraphs and its applications to positional games ⋮ Strong cliques in diamond-free graphs ⋮ Betti numbers of some circulant graphs ⋮ Detecting strong cliques ⋮ Unnamed Item

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Proof of Chvátal's conjecture on maximal stable sets and maximal cliques in graphs
• Well-covered circulant graphs
• On exact blockers and anti-blockers, \(\varDelta \)-conjecture, and related problems
• On circular critical graphs
• Independence polynomials of circulants with an application to music
• Hardness results and spectral techniques for combinatorial problems on circulant graphs
• Complement reducible graphs
• Combinatorial designs related to the strong perfect graph conjecture
• The structure of well-covered graphs and the complexity of their recognition problems
• A circular graph---counterexample to the Duchet kernel conjecture
• Generalizations of Grillet's theorem on maximal stable sets and maximal cliques in graphs
• Ádám's conjecture is true in the square-free case
• On graphs whose maximal cliques and stable sets intersect
• Grinstead's conjecture is true for graphs with a small clique number
• Normal hypergraphs and the perfect graph conjecture
• A Characterization of Almost CIS Graphs
• Complexity results for well‐covered graphs
• WELL-COVERED GRAPHS: A SURVEY
• PRODUCTS OF CIRCULANT GRAPHS
• Some covering concepts in graphs
• Blocking and anti-blocking pairs of polyhedra

This page was built for publication: On CIS circulants