On certain eigenspaces of cographs.
Sander, Torsten (2008)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
Sander, Torsten (2008)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
Bohdan Zelinka (1986)
Mathematica Slovaca
Similarity:
Paul, Alice, Pippenger, Nicholas (2011)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
Bohdan Zelinka (1975)
Czechoslovak Mathematical Journal
Similarity:
Markov, Minko (2008)
Serdica Journal of Computing
Similarity:
We investigate the NP-complete problem Vertex Separation (VS) on Maximal Outerplanar Graphs (mops). We formulate and prove a “main theorem for mops”, a necessary and sufficient condition for the vertex separation of a mop being k. The main theorem reduces the vertex separation of mops to a special kind of stretchability, one that we call affixability, of submops.