scientific article; zbMATH DE number 2096440

MaRDI QIDQ4810372zbMATH OpenFDO

Authors F. Larrión, Thom Porter, V. Neumann-Lara, M. A. Pizaña

Publication date 6 September 2004

zbMATH Keywords

graph isomorphismrecognition problemsself-clique graphs

Mathematics Subject Classification ID

Isomorphism problems in graph theory (reconstruction conjecture, etc.) and homomorphisms (subgraph embedding, etc.) (05C60) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69) Graph theory (including graph drawing) in computer science (68R10)

Recommendations

• A hierarchy of self-clique graphs
• On self-clique graphs all of whose cliques have equal size.
• On self-clique graphs with given clique sizes. II
• scientific article; zbMATH DE number 1990681
• On self-clique graphs with triangular cliques

Cited in

(8)

• On self-clique graphs with given clique sizes. II
• Recognizing clique graphs of directed and rooted path graphs
• A hierarchy of self-clique graphs
• On hereditary clique-Helly self-clique graphs
• On self-clique shoal graphs
• Self‐clique graphs and matrix permutations
• On self-clique graphs all of whose cliques have equal size.
• On self-clique graphs with triangular cliques

This page was built for publication:

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