Planar drawings of higher-genus graphs.
Duncan, Christian A., Goodrich, Michael T., Kobourov, Stephen G. (2011)
Journal of Graph Algorithms and Applications
Similarity:
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
Displaying similar documents to “More canonical ordering.”
Planar drawings of higher-genus graphs.
Morphing planar graph drawings with bent edges.
Lubiw, Anna, Petrick, Mark (2011)
Journal of Graph Algorithms and Applications
Similarity:
I/O-optimal algorithms for outerplanar graphs.
Maheshwari, Anil, Zeh, Norbert (2004)
Journal of Graph Algorithms and Applications
Similarity:
Degree-constrained edge partitioning in graphs arising from discrete tomography.
Bentz, Cedric, Costa, Marie-Christine, Picouleau, Christophe, Ries, Bernard, De Werra, Dominique (2009)
Journal of Graph Algorithms and Applications
Similarity:
On the recognition of bipolarizable and -simplicial graphs.
Nikolopoulos, Stavros D., Palios, Leonidas (2005)
Discrete Mathematics and Theoretical Computer Science. DMTCS [electronic only]
Similarity:
Recognizing HH-free, HHD-free, and Welsh-Powell opposition graphs.
Nikolopoulos, Stavros D., Palios, Leonidas (2006)
Discrete Mathematics and Theoretical Computer Science. DMTCS [electronic only]
Similarity:
On the cutting edge: simplified planarity by edge addition.
Boyer, John M., Myrvold, Wendy J. (2004)
Journal of Graph Algorithms and Applications
Similarity:
Graph minors and minimum degree.
Fijavž, Gašper, Wood, David R. (2010)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
Efficient offline algorithmic techniques for several packet routing problems in distributed systems.
Andreica, Mugurel Ionuţ, Ţăpuş, Nicolae (2009)
Acta Universitatis Apulensis. Mathematics - Informatics
Similarity:
Drawing graphs on two and three lines.
Cornelsen, Sabine, Schank, Thomas, Wagner, Dorothea (2004)
Journal of Graph Algorithms and Applications
Similarity:
Cyclic connectivity classes of directed graphs.
Hetyei, Gábor (2001)
Acta Mathematica Academiae Paedagogicae Nyí regyháziensis. New Series [electronic only]
Similarity:
Constructing hypohamiltonian snarks with cyclic connectivity 5 and 6.
Máčajová, Edita, Škoviera, Martin (2007)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
The complexity of obtaining a distance-balanced graph.
Cabello, Sergio, Lukšič, Primož (2011)
The Electronic Journal of Combinatorics [electronic only]
Similarity: