A uniform approach to complexes arising from forests.
Marietti, Mario, Testa, Damiano (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.
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.
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.
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.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
Marietti, Mario, Testa, Damiano (2008)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
Kawamura, Kazuhiro (2011)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
Braun, Benjamin (2011)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
Idzik, Adam, Zapart, Anna (2010)
Fixed Point Theory and Applications [electronic only]
Similarity:
Bohdan Zelinka (1967)
Matematický časopis
Similarity:
Bohdan Zelinka (1976)
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.