A new characterization of strictly interval graphs yields a linear recognition algorithm, and SI-core graphs are defined as non-split non-cograph graphs with several Laplacian integral members.
(Eds.) Algorithms and Computation (ISAAC 2000)LNCS1969(2000) 539-551
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
cs.DM 1years
2025 1verdicts
UNVERDICTED 1representative citing papers
citing papers explorer
-
Structural and Spectral Properties of Strictly Interval Graphs
A new characterization of strictly interval graphs yields a linear recognition algorithm, and SI-core graphs are defined as non-split non-cograph graphs with several Laplacian integral members.