Clustering cycles into cycles of clusters.
Cortese, Pier Francesco, Di Battista, Giuseppe, Patrignani, Maurizio, Pizzonia, Maurizio (2005)
Journal of Graph Algorithms and Applications
Similarity:
Cortese, Pier Francesco, Di Battista, Giuseppe, Patrignani, Maurizio, Pizzonia, Maurizio (2005)
Journal of Graph Algorithms and Applications
Similarity:
Zofia Majcher (1987)
Commentationes Mathematicae Universitatis Carolinae
Similarity:
Leo Liberti, Edoardo Amaldi, Francesco Maffioli, Nelson Maculan (2005)
The Yugoslav Journal of Operations Research
Similarity:
Eppstein, David (2007)
Journal of Graph Algorithms and Applications
Similarity:
Terry A. McKee (2012)
Discussiones Mathematicae Graph Theory
Similarity:
A graph is edge cycle extendable if every cycle C that is formed from edges and one chord of a larger cycle C⁺ is also formed from edges and one chord of a cycle C' of length one greater than C with V(C') ⊆ V(C⁺). Edge cycle extendable graphs are characterized by every block being either chordal (every nontriangular cycle has a chord) or chordless (no nontriangular cycle has a chord); equivalently, every chord of a cycle of length five or more has a noncrossing chord.
Leydold, Josef, Stadler, Peter F. (1998)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
Vasil Jacoš, Stanislav Jendroľ (1974)
Matematický časopis
Similarity:
Hossein Karami, Rana Khoeilar, Seyed Mahmoud Sheikholeslami (2013)
Kragujevac Journal of Mathematics
Similarity:
Rahman, Md.Saidur, Nakano, Shin-ichi, Nishizeki, Takao (1999)
Journal of Graph Algorithms and Applications
Similarity: