Vertex-transitive CIS graphs
From MaRDI portal
Publication:472401
DOI10.1016/j.ejc.2014.09.007zbMath1302.05077arXiv1405.7874OpenAlexW1995147377MaRDI QIDQ472401
Martin Milanič, Edward Dobson, Ademir Hujdurović, Gabriel Verret
Publication date: 19 November 2014
Published in: European Journal of Combinatorics (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1405.7874
Finite automorphism groups of algebraic, geometric, or combinatorial structures (20B25) Graphs and abstract algebra (groups, rings, fields, etc.) (05C25) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69)
Related Items (10)
A characterization of claw-free CIS graphs and new results on the order of CIS graphs ⋮ Presentations for vertex-transitive graphs ⋮ Edge-transitive lexicographic and Cartesian products ⋮ On equistable, split, CIS, and related classes of graphs ⋮ Strong cliques in vertex‐transitive graphs ⋮ Unconditional reflexive polytopes ⋮ Graphs vertex-partitionable into strong cliques ⋮ On Minkowski space and finite geometry ⋮ Strong cliques in diamond-free graphs ⋮ Detecting strong cliques
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- On CIS circulants
- Proof of Chvátal's conjecture on maximal stable sets and maximal cliques in graphs
- Well-covered circulant graphs
- Graphs of linear clique-width at most 3
- The strong perfect graph theorem
- On well-covered triangulations. II.
- On well-covered triangulations. III
- Proof of Ding's conjecture on maximal stable sets and maximal cliques in planar graphs
- A characterization of a class of symmetric graphs of twice prime valency
- The transitive groups of degree twelve
- Algorithmic graph theory and perfect graphs
- Generalizations of Grillet's theorem on maximal stable sets and maximal cliques in graphs
- On graphs whose maximal cliques and stable sets intersect
- A note on coloring vertex-transitive graphs
- Bipartite bihypergraphs: a survey and new results
- A characterization of perfect graphs
- The structure of well-covered graphs with no cycles of length 4
- A class of weakly perfect graphs
- On the Maximum Independent Set Problem in Subclasses of Planar Graphs
- On a Class of Fixed-Point-Free Graphs
- A Characterization of Almost CIS Graphs
- Randomly matchable graphs
- WELL-COVERED GRAPHS: A SURVEY
- WEAKLY PERFECT GRAPHS ARISING FROM RINGS
- Well-Covered Vector Spaces of Graphs
- Maximal chains and antichains
- Some covering concepts in graphs
This page was built for publication: Vertex-transitive CIS graphs
