Two-radially maximal graphs with special centers
Ferdinand Gliviak, Martin Knor, Ľubomír Šoltés (1995)
Mathematica Slovaca
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 “Control flow graphs and code coverage”
Two-radially maximal graphs with special centers
On some path problems on oriented hypergraphs
S. Nguyen, D. Pretolani, L. Markenzon (1998)
RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications
Similarity:
Centers in iterated line graphs.
Knor, M., Niepel, L., Olts, L. (1992)
Acta Mathematica Universitatis Comenianae. New Series
Similarity:
On coefficients of path polynomials.
Farrell, E.J. (1984)
International Journal of Mathematics and Mathematical Sciences
Similarity:
Centers in line graphs
Martin Knor, Ľudovít Niepel, Ľubomír Šoltés (1993)
Mathematica Slovaca
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:
Some general classes of comatching graphs.
Farrell, E.J., Wahid, S.A. (1987)
International Journal of Mathematics and Mathematical Sciences
Similarity:
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: