Methods of destroying the symmetries of a graph.
Harary, Frank (2001)
Bulletin of the Malaysian Mathematical Sciences Society. Second Series
Similarity:
Displaying similar documents to “The structure of k-chromatic graphs”
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:
Centers in iterated line graphs.
Knor, M., Niepel, L., Olts, L. (1992)
Acta Mathematica Universitatis Comenianae. New Series
Similarity:
Computing and drawing isomorphic subgraphs.
Bachl, S., Brandenburg, F.-J., Gmach, D. (2004)
Journal of Graph Algorithms and Applications
Similarity:
On the connection between the theory of signal flow graphs and the theory of directed graphs
J. Niedereichholz (1970)
ESAIM: Mathematical Modelling and Numerical Analysis - Modélisation Mathématique et Analyse Numérique
Similarity:
Two-radially maximal graphs with special centers
Ferdinand Gliviak, Martin Knor, Ľubomír Šoltés (1995)
Mathematica Slovaca
Similarity:
Drawing graphs within graphs.
Holleis, Paul, Zimmermann, Thomas, Gmach, Daniel (2005)
Journal of Graph Algorithms and Applications
Similarity: