Methods of destroying the symmetries of a graph.

Harary, Frank

Displaying similar documents to “Methods of destroying the symmetries of a graph.”

Centers in line graphs

Martin Knor, Ľudovít Niepel, Ľubomír Šoltés (1993)

Mathematica Slovaca

Similarity:

Computing and drawing isomorphic subgraphs.

Bachl, S., Brandenburg, F.-J., Gmach, D. (2004)

Journal of Graph Algorithms and Applications

Similarity:

The structure of k-chromatic graphs

G. Dirac (1953)

Fundamenta Mathematicae

Similarity:

On the proper intervalization of colored caterpillar trees

Carme Àlvarez, Maria Serna (2009)

RAIRO - Theoretical Informatics and Applications

Similarity:

This paper studies the computational complexity of the problem (), when the input graph is a colored caterpillar, parameterized by hair length. In order prove our result we establish a close relationship between the and a graph layout problem the (). We show a dichotomy: the and the are NP-complete for colored caterpillars of hair length 2, while both problems are in P for colored caterpillars of hair length 2. For the hardness results we provide a reduction from the , while the...

Characterization of magic graphs

Samuel Jezný, Marián Trenkler (1983)

Czechoslovak Mathematical Journal

Similarity:

Centers in iterated line graphs.

Knor, M., Niepel, L., Olts, L. (1992)

Acta Mathematica Universitatis Comenianae. New Series

Similarity:

Drawing graphs within graphs.

Holleis, Paul, Zimmermann, Thomas, Gmach, Daniel (2005)

Journal of Graph Algorithms and Applications

Similarity: