Cutwidth of the de Bruijn graph
André Raspaud, Ondrej Sýkora, Imrich Vrt'o (1995)
RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications
Similarity:
Displaying similar documents to “On bandwidth, cutwidth, and quotient graphs”
Cutwidth of the de Bruijn graph
Pebbling dynamic graphs in minimal space
Peter Ružička, Juraj Waczulík (1994)
RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications
Similarity:
A survey of the algorithmic properties of simplicial, upper bound and middle graphs.
Cheston, Grant A., Jap, Tjoen Seng (2006)
Journal of Graph Algorithms and Applications
Similarity:
Well covered and well dominated block graphs and unicyclic graphs.
Topp, Jerzy, Volkmann, Lutz (1990)
Mathematica Pannonica
Similarity:
Distinct distances in graph drawings.
Carmi, Paz, Dujmovic, Vida, Morin, Pat, Wood, David R. (2008)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
Crossing numbers and cutwidths.
Djidjev, Hristo N., Vrt'o, Imrich (2003)
Journal of Graph Algorithms and Applications
Similarity:
The coarseness of a graph
Lowell W. Beineke, Gary Chartrand (1968)
Compositio Mathematica
Similarity:
Recognizing maximal unfrozen graphs with respect to independent sets is CO-NP-complete.
Abbas, N., Culberson, J., Stewart, L. (2005)
Discrete Mathematics and Theoretical Computer Science. DMTCS [electronic only]
Similarity:
Hypergraph systems and their extensions
D. Janssens, G. Rozenberg (1983)
RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications
Similarity: