Drawing graphs on two and three lines.
Cornelsen, Sabine, Schank, Thomas, Wagner, Dorothea (2004)
Journal of Graph Algorithms and Applications
Similarity:
Cornelsen, Sabine, Schank, Thomas, Wagner, Dorothea (2004)
Journal of Graph Algorithms and Applications
Similarity:
Boyer, John M., Myrvold, Wendy J. (2004)
Journal of Graph Algorithms and Applications
Similarity:
Di Giacomo, Emilio, Didimo, Walter, Liotta, Giuseppe, Meijer, Henk (2005)
Journal of Graph Algorithms and Applications
Similarity:
Devillers, Olivier, Everett, Hazel, Lazard, Sylvain, Pentcheva, Maria, Wismath, Stephen (2006)
Journal of Graph Algorithms and Applications
Similarity:
Di Giacomo, Emilio, Didimo, Walter, Liotta, Giuseppe, Palladino, Pietro (2010)
Journal of Graph Algorithms and Applications
Similarity:
Angelini, Patrizio, Cittadini, Luca, Didimo, Walter, Frati, Fabrizio, Di Battista, Giuseppe, Kaufmann, Michael, Symvonis, Antonios (2011)
Journal of Graph Algorithms and Applications
Similarity:
Di Battista, Giuseppe, Patrignani, Maurizio (2000)
Journal of Graph Algorithms and Applications
Similarity:
Lubiw, Anna, Petrick, Mark (2011)
Journal of Graph Algorithms and Applications
Similarity:
Duncan, Christian A., Goodrich, Michael T., Kobourov, Stephen G. (2011)
Journal of Graph Algorithms and Applications
Similarity:
Felsner, Stefan, Zickfeld, Florian (2008)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
Felsner, Stefan, Liotta, Giuseppe, Wismath, Stephen (2003)
Journal of Graph Algorithms and Applications
Similarity:
Arge, Lars, Meyer, Ulrich, Toma, Laura, Zeh, Norbert (2003)
Journal of Graph Algorithms and Applications
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.