On self-clique graphs all of whose cliques have equal size.

MaRDI QIDQ4924916zbMATH OpenFDO

Authors Poh-Hwa Ong, Gek L. Chia

Publication date 10 June 2013

zbMATH Keywords

clique graphmaximal cliqueself-clique graph

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69)

Recommendations

• On self-clique graphs with given clique sizes. II
• scientific article; zbMATH DE number 1990681
• On self-clique graphs with given clique sizes
• scientific article; zbMATH DE number 2096440
• On self-clique graphs with triangular cliques

Cited in

(15)

• On self-clique graphs with given clique sizes. II
• On self-clique graphs with given clique sizes
• On self-clique shoal graphs
• On clique graphs with linear size
• A sufficient condition for self-clique graphs
• scientific article; zbMATH DE number 19202 (Why is no real title available?)
• On replete graphs
• scientific article; zbMATH DE number 734470 (Why is no real title available?)
• scientific article; zbMATH DE number 1990681 (Why is no real title available?)
• Self‐clique graphs and matrix permutations
• scientific article; zbMATH DE number 1866901 (Why is no real title available?)
• scientific article; zbMATH DE number 2096440 (Why is no real title available?)
• Clique‐convergence is undecidable for automatic graphs
• Unique eccentric clique graphs
• On self-clique graphs with triangular cliques

This page was built for publication: On self-clique graphs all of whose cliques have equal size.

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4924916)