On coefficients of path polynomials.
Farrell, E.J. (1984)
International Journal of Mathematics and Mathematical Sciences
Similarity:
Displaying similar documents to “Some graphic uses of an even number of odd nodes”
On coefficients of path polynomials.
Planarity testing and optimal edge insertion with embedding constraints.
Gutwenger, Carsten, Klein, Karsten, Mutzel, Petra (2008)
Journal of Graph Algorithms and Applications
Similarity:
Characterizing families of cuts that can be represented by axis-parallel rectangles.
Brandes, Ulrik, Cornelsen, Sabine, Wagner, Dorothea (2005)
Journal of Graph Algorithms and Applications
Similarity:
Drawing planar graphs with large vertices and thick edges.
Barequet, Gill, Goodrich, Michael T., Riley, Chris (2004)
Journal of Graph Algorithms and Applications
Similarity:
Methods of destroying the symmetries of a graph.
Harary, Frank (2001)
Bulletin of the Malaysian Mathematical Sciences Society. Second Series
Similarity:
Experiments with the fixed-parameter approach for two-layer planarization.
Suderman, Matthew, Whitesides, Sue (2005)
Journal of Graph Algorithms and Applications
Similarity:
Level planar embedding in linear time.
Jünger, Michael, Leipert, Sebastian (2002)
Journal of Graph Algorithms and Applications
Similarity:
On a class of polynomials associated with the paths in a graph and its application to minimum nodes disjoint path coverings of graphs.
Farrell, E.J. (1983)
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:
Reliability of communication networks with delay constraints: computational complexity and complete topologies.
Cancela, H., Petingi, L. (2004)
International Journal of Mathematics and Mathematical Sciences
Similarity: