A Partial Characterization of Clique Graphs

Hamelink, R. C. (1968). A Partial Characterization of Clique Graphs. Journal of Combinatorial Theory, 5(2), 192-197.

Type

Journal article

Intellectual base

Primary research

Year

1968

DOI

10.1016/s0021-9800(68)80055-9

Link

https://doi.org/10.1016/s0021-9800(68)80055-9

Cited by

1 citation across 1 artifact.

Domain-specific

• Clique graph
  • The clique graph (K(G)) of an undirected graph (G) has one vertex for every maximal clique of (G), with two distinct vertices adjacent exactly when their corresponding maximal cliques have nonempty intersection.

Verification

This reference passed the adversarial substantiation pipeline: it was checked to exist and to support the claim it is attached to. See how references were verified.

Registry ID ref:31868c57e954 · see in the full table