Orthogonal drawings of plane graphs without bends.
Rahman, Md.Saidur, Nishizeki, Takao, Naznin, Mahmuda (2003)
Journal of Graph Algorithms and Applications
Similarity:
Displaying similar documents to “A linear algorithm for bend-optimal orthogonal drawings of triconnected cubic plane graphs.”
Orthogonal drawings of plane graphs without bends.
Clustering cycles into cycles of clusters.
Cortese, Pier Francesco, Di Battista, Giuseppe, Patrignani, Maurizio, Pizzonia, Maurizio (2005)
Journal of Graph Algorithms and Applications
Similarity:
A problem concerning -pancyclic graphs
Vasil Jacoš, Stanislav Jendroľ (1974)
Matematický časopis
Similarity:
For which graphs does every edge belong to exactly two chordless cycles?
Peled, Uri N., Wu, Julin (1996)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
On the crossing numbers of Cartesian products of stars and paths or cycles
Marián Klešč (1991)
Mathematica Slovaca
Similarity:
On -Pancyclic Graphs
Vasil Jacoš (1975)
Matematický časopis
Similarity:
The traveling salesman problem for cubic graphs.
Eppstein, David (2007)
Journal of Graph Algorithms and Applications
Similarity:
Planar graphs without triangles adjacent to cycles of length from 3 to 9 are 3-colorable.
Borodin, O.V., Glebov, A.N., Jensen, Tommy R., Raspaud, Andre (2006)
Sibirskie Ehlektronnye Matematicheskie Izvestiya [electronic only]
Similarity:
Lattice structures from planar graphs.
Felsner, Stefan (2004)
The Electronic Journal of Combinatorics [electronic only]
Similarity: