Simultaneous graph drawing: layout algorithms and visualization schemes.
Erten, C., Kobourov, S.G., Le, V., Navabi, A. (2005)
Journal of Graph Algorithms and Applications
Similarity:
Displaying similar documents to “Drawing graphs within graphs.”
Simultaneous graph drawing: layout algorithms and visualization schemes.
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:
Challenging complexity of maximum common subgraph detection algorithms: A performance analysis of three algorithms on a wide database of graphs.
Conte, Donatello, Foggia, Pasquale, Vento, Mario (2007)
Journal of Graph Algorithms and Applications
Similarity:
Navigating clustered graphs using force-directed methods.
Eades, Peter, Huang, Lin Mao (2000)
Journal of Graph Algorithms and Applications
Similarity:
Some general classes of comatching graphs.
Farrell, E.J., Wahid, S.A. (1987)
International Journal of Mathematics and Mathematical Sciences
Similarity:
Planarizing graphs---a survey and annotated bibliography.
Liebers, Annegret (2001)
Journal of Graph Algorithms and Applications
Similarity:
Centers in iterated line graphs.
Knor, M., Niepel, L., Olts, L. (1992)
Acta Mathematica Universitatis Comenianae. New Series
Similarity:
A note on the graph equation .
Simić, Slobodan K. (1988)
Publications de l'Institut Mathématique. Nouvelle Série
Similarity:
Graph equations, graph inequalities and a fixed point theorem.
I.B. Lackovic, D.M. Cvetkovic (1976)
Publications de l'Institut Mathématique [Elektronische Ressource]
Similarity:
An introduction to -graphs, a graph-theoretic representation of natural numbers.
Farrell, E.J. (1992)
International Journal of Mathematics and Mathematical Sciences
Similarity:
Degree Sequences of Monocore Graphs
Allan Bickle (2014)
Discussiones Mathematicae Graph Theory
Similarity:
A k-monocore graph is a graph which has its minimum degree and degeneracy both equal to k. Integer sequences that can be the degree sequence of some k-monocore graph are characterized as follows. A nonincreasing sequence of integers d0, . . . , dn is the degree sequence of some k-monocore graph G, 0 ≤ k ≤ n − 1, if and only if k ≤ di ≤ min {n − 1, k + n − i} and ⨊di = 2m, where m satisfies [...] ≤ m ≤ k ・ n − [...] .