A complete grammar for decomposing a family of graphs into 3-connected components.
Chapuy, Guillaume, Fusy, Éric, Kang, Mihyun, Shoilekova, Bilyana (2008)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
Chapuy, Guillaume, Fusy, Éric, Kang, Mihyun, Shoilekova, Bilyana (2008)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
de Fraysseix, Hubert, Ossona de Mendez, Patrice (2001)
Journal of Graph Algorithms and Applications
Similarity:
Cornelsen, Sabine, Schank, Thomas, Wagner, Dorothea (2004)
Journal of Graph Algorithms and Applications
Similarity:
Arge, Lars, Meyer, Ulrich, Toma, Laura, Zeh, Norbert (2003)
Journal of Graph Algorithms and Applications
Similarity:
Di Giacomo, Emilio, Didimo, Walter, Liotta, Giuseppe, Palladino, Pietro (2010)
Journal of Graph Algorithms and Applications
Similarity:
Felsner, Stefan, Liotta, Giuseppe, Wismath, Stephen (2003)
Journal of Graph Algorithms and Applications
Similarity:
Calamoneri, Tiziana, Jannelli, Simone, Petreschi, Rossella (1999)
Journal of Graph Algorithms and Applications
Similarity:
Felsner, Stefan, Zickfeld, Florian (2008)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
Eppstein, David (1999)
Journal of Graph Algorithms and Applications
Similarity:
Eades, Peter, Feng, Qingwen, Nagamochi, Hiroshi (1999)
Journal of Graph Algorithms and Applications
Similarity:
Maheshwari, Anil, Zeh, Norbert (2004)
Journal of Graph Algorithms and Applications
Similarity: