Scattering number and modular decomposition

DOI10.1016/S0012-365X(96)00180-XzbMath0882.05085MaRDI QIDQ1356754

Vassilis Giakoumakis, Henri Thuillier, F. Roussel

Publication date: 2 March 1998

Published in: Discrete Mathematics (Search for Journal in Brave)

zbMATH Keywords

Hamiltonicityforbidden subgraphsscattering numberchordless cyclepath partition numbermodular decomposition tree

Mathematics Subject Classification ID

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

Related Items (3)

Relationships between scattering number and other vulnerability parameters ⋮ A polynomial algorithm for weighted scattering number in interval graphs ⋮ The average scattering number of graphs

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Graph derivatives
• Complement reducible graphs
• A tree representation for \(P_ 4\)-sparse graphs
• On a class of posets and the corresponding comparability graphs
• On semi-\(P_ 4\)-sparse graphs
• Graphs indecomposable with respect to the X-join
• Tough graphs and Hamiltonian circuits.
• A Fast Algorithm for the Decomposition of Graphs and Posets
• A Linear Recognition Algorithm for Cographs
• Recognizing $P_4 $-Sparse Graphs in Linear Time
• Transitiv orientierbare Graphen

This page was built for publication: Scattering number and modular decomposition