On bandwidth, cutwidth, and quotient graphs
Dominique Barth, François Pellegrini, André Raspaud, Jean Roman (1995)
RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications
Similarity:
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
Displaying similar documents to “Cutwidth of the de Bruijn graph”
On bandwidth, cutwidth, and quotient graphs
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:
On equality of edge-connectivity and minimum degree of a graph
Ján Plesník, Štefan Znám (1989)
Archivum Mathematicum
Similarity:
Crossing numbers and cutwidths.
Djidjev, Hristo N., Vrt'o, Imrich (2003)
Journal of Graph Algorithms and Applications
Similarity:
Contraction and treewidth lower bounds.
Bodlaender, Hans L., Wolle, Thomas, Koster, Arie M.C.A. (2006)
Journal of Graph Algorithms and Applications
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:
Distinct distances in graph drawings.
Carmi, Paz, Dujmovic, Vida, Morin, Pat, Wood, David R. (2008)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
The coarseness of a graph
Lowell W. Beineke, Gary Chartrand (1968)
Compositio Mathematica
Similarity: