Graphs with unique maximal clumpings

DOI10.1002/JGT.3190020104MaRDI QIDQ4156807zbMATH OpenOpenAlexFDO

Authors 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)

Cited in

(13)

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

This page was built for publication: Graphs with unique maximal clumpings

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