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:
Displaying similar documents to “Clustering cycles into cycles of clusters.”
For which graphs does every edge belong to exactly two chordless cycles?
A problem concerning -pancyclic graphs
Vasil Jacoš, Stanislav Jendroľ (1974)
Matematický časopis
Similarity:
Characterizing families of cuts that can be represented by axis-parallel rectangles.
Brandes, Ulrik, Cornelsen, Sabine, Wagner, Dorothea (2005)
Journal of Graph Algorithms and Applications
Similarity:
Planar graphs with topological constraints.
Dornheim, Christoph (2002)
Journal of Graph Algorithms and Applications
Similarity:
A linear algorithm for bend-optimal orthogonal drawings of triconnected cubic plane graphs.
Rahman, Md.Saidur, Nakano, Shin-ichi, Nishizeki, Takao (1999)
Journal of Graph Algorithms and Applications
Similarity:
On the crossing numbers of Cartesian products of stars and paths or cycles
Marián Klešč (1991)
Mathematica Slovaca
Similarity:
Lattice structures from planar graphs.
Felsner, Stefan (2004)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
Planar drawings of higher-genus graphs.
Duncan, Christian A., Goodrich, Michael T., Kobourov, Stephen G. (2011)
Journal of Graph Algorithms and Applications
Similarity: