On Graphs Without Multicliqual Edges

DOI10.1002/JGT.3190050416MaRDI QIDQ3953805zbMATH OpenOpenAlexFDO

Authors

Publication date 1981

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

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

zbMATH Keywords

complete subgraphsclique-graphscritical generators

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Structural characterization of families of graphs (05C75)

Cited in

(13)

• Structural results on circular-arc graphs and circle graphs: a survey and the main open problems
• Characterization of classical graph classes by weighted clique graphs
• Communication cliques in mobile phone calling networks
• Cube intersection concepts in median graphs
• The clique operator on cographs and serial graphs
• A hierarchy of self-clique graphs
• About some robustness and complexity properties of G-graphs networks
• Clique graphs and Helly graphs
• A class of clique-closed graphs
• On hereditary clique-Helly self-clique graphs
• Partial characterizations of circular-arc graphs
• Convergence of iterated clique graphs
• Partial characterizations of clique-perfect graphs II: Diamond-free and Helly circular-arc graphs

This page was built for publication: On Graphs Without Multicliqual Edges

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