Strong cliques in vertex‐transitive graphs

DOI10.1002/jgt.22573arXiv1808.09534OpenAlexW3022201294MaRDI QIDQ6134644

Ademir Hujdurović

Publication date: 22 August 2023

Published in: Journal of Graph Theory (Search for Journal in Brave)

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

zbMATH Keywords

vertex-transitive graphmaximum cliquestrong cliqueCIS graphlocalizable graph

Mathematics Subject Classification ID

Graph theory (05Cxx)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• On equistable, split, CIS, and related classes of graphs
• On CIS circulants
• Vertex-transitive CIS graphs
• Hardness of computing clique number and chromatic number for Cayley graphs
• On exact blockers and anti-blockers, \(\varDelta \)-conjecture, and related problems
• Stochastic graphs and strongly perfect graphs - a survey
• On a conjecture of Meyniel
• On the perfect graph conjecture
• Efficient algorithms for minimum weighted colouring of some classes of perfect graphs
• Graphs vertex-partitionable into strong cliques
• Generalizations of Grillet's theorem on maximal stable sets and maximal cliques in graphs
• Detecting strong cliques
• A note on coloring vertex-transitive graphs
• ModelingK-coteries by well-covered graphs
• A Characterization of Almost CIS Graphs
• WELL-COVERED GRAPHS: A SURVEY
• Uniquely colorable Cayley graphs

This page was built for publication: Strong cliques in vertex‐transitive graphs