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:
Di Battista, Giuseppe, Patrignani, Maurizio (2000)
Journal of Graph Algorithms and Applications
Similarity:
Milica Stojanović, Milica Vučković (2007)
Kragujevac Journal of Mathematics
Similarity:
Carmignani, Andrea, Di Battista, Giuseppe, Didimo, Walter, Matera, Francesco, Pizzonia, Maurizio (2002)
Journal of Graph Algorithms and Applications
Similarity:
Bohdan Zelinka (1973)
Časopis pro pěstování matematiky
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.
Devillers, Olivier, Everett, Hazel, Lazard, Sylvain, Pentcheva, Maria, Wismath, Stephen (2006)
Journal of Graph Algorithms and Applications
Similarity:
Eiglsperger, Markus, Siebenhaller, Martin, Kaufmann, Michael (2005)
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, Palladino, Pietro (2010)
Journal of Graph Algorithms and Applications
Similarity: