On replete graphs

DOI10.1002/JGT.3190160208MaRDI QIDQ4013419zbMATH OpenOpenAlexFDO

Authors

Publication date 27 September 1992

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

Full work available at URL https://doi.org/10.1002/jgt.3190160208

zbMATH Keywords

clique numberdegreeselementary homomorphism\(k\)-clique replete graph

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35)

Recommendations

• On clique-complete graphs
• scientific article; zbMATH DE number 1189244
• scientific article; zbMATH DE number 426170
• On self-clique graphs all of whose cliques have equal size.
• scientific article; zbMATH DE number 19181

Cites work

• A Theorem on k-Saturated Graphs

Cited in

(2)

• On the plurality of graphs
• Complete graphs in the Rubáiyát

This page was built for publication: On replete graphs

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