On Graphs Without Multicliqual Edges
From MaRDI portal
Publication:3953805
DOI10.1002/jgt.3190050416zbMath0492.05056OpenAlexW2073043846MaRDI QIDQ3953805
No author found.
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
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)
Related Items (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 ⋮ Convergence of iterated clique graphs ⋮ About some robustness and complexity properties of \(G\)-graphs networks ⋮ On hereditary clique-Helly self-clique graphs ⋮ Partial characterizations of clique-perfect graphs II: Diamond-free and Helly circular-arc graphs ⋮ Cube intersection concepts in median graphs ⋮ The clique operator on cographs and serial graphs ⋮ A hierarchy of self-clique graphs ⋮ Partial characterizations of circular-arc graphs ⋮ Clique graphs and Helly graphs ⋮ A class of clique-closed graphs
Cites Work
This page was built for publication: On Graphs Without Multicliqual Edges
