Graphs with unique maximal clumpings

DOI10.1002/jgt.3190020104zbMath0377.05036OpenAlexW1981374505MaRDI QIDQ4156807

Andreas Blass

Publication date: 1978

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

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

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Graph theory (05C99)

Related Items

A \(k\)-structure generalization of the theory of 2-structures, An \(O(n^ 2)\) incremental algorithm for modular decomposition of graphs and 2-structures, On semi-\(P_ 4\)-sparse graphs, From modular decomposition trees to level-1 networks: pseudo-cographs, polar-cats and prime polar-cats, 3-transpositions in infinite groups, Cograph editing: Merging modules is equivalent to editing P_4s, A survey of the algorithmic aspects of modular decomposition, Local indecomposability of certain geometric graphs, Minimal asymmetric graphs of induced length 4, Clumps, minimal asymmetric graphs, and involutions, On fischer' characterizations of ∑₅and ∑_n, A uniqueness lemma for groups generated by 3-transpositions, Bibliography on domination in graphs and some basic definitions of domination parameters