Clique graphs of time graphs

DOI10.1016/0095-8956(84)90059-5MaRDI QIDQ798677zbMATH OpenOpenAlexFDO

Authors Bruce A. Hedman

Publication date 1984

Published in Journal of Combinatorial Theory. Series B (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/0095-8956(84)90059-5

zbMATH Keywords

clique graphdiameterindifference graphtime graph

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Graph theory (05C99)

Review text

See the preview in Zbl 0537.05057.

Cites work

• A characterization of clique graphs
• A partial characterization of clique graphs
• scientific article; zbMATH DE number 3859178 (Why is no real title available?)
• scientific article; zbMATH DE number 3637904 (Why is no real title available?)
• scientific article; zbMATH DE number 3248704 (Why is no real title available?)
• scientific article; zbMATH DE number 3307330 (Why is no real title available?)
• scientific article; zbMATH DE number 3402664 (Why is no real title available?)
• On the compatibility between a graph and a simple order
• On time graphs
• Space graphs and sphericity
• Über iterierte Clique-Graphen

Cited in

(21)

• Cube intersection concepts in median graphs
• Convergence of iterated clique graphs
• Clique divergent graphs with unbounded sequence of diameters
• A class of clique-closed graphs
• On clique-complete graphs
• Decompositions for the edge colouring of reduced indifference graphs.
• The clique operator on cographs and serial graphs
• Distances and diameters on iterated clique graphs
• Minimum proper interval graphs
• On clique convergent graphs
• Normal Helly circular-arc graphs and its subclasses
• Biclique graphs of interval bigraphs
• Rank inequalities for chordal graphs
• Characterization of classical graph classes by weighted clique graphs
• Distances and diameters on iterated clique graphs
• On the number of spanning trees, the Laplacian eigenvalues, and the Laplacian Estrada index of subdivided-line graphs
• Structural properties of biclique graphs and the distance formula
• Modification problems toward proper (Helly) circular-arc graphs
• A linear-time algorithm for proper interval graph recognition
• Clique graphs and Helly graphs
• The clique operator on circular-arc graphs

This page was built for publication: Clique graphs of time graphs

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