Maximum cardinality 1-restricted simple 2-matchings.
Hartvigsen, David (2007)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
Displaying similar documents to “Perfectly matchable subgraph problem on a bipartite graph”
Maximum cardinality 1-restricted simple 2-matchings.
Computing and drawing isomorphic subgraphs.
Bachl, S., Brandenburg, F.-J., Gmach, D. (2004)
Journal of Graph Algorithms and Applications
Similarity:
Centers in line graphs
Martin Knor, Ľudovít Niepel, Ľubomír Šoltés (1993)
Mathematica Slovaca
Similarity:
Methods of destroying the symmetries of a graph.
Harary, Frank (2001)
Bulletin of the Malaysian Mathematical Sciences Society. Second Series
Similarity:
Algorithmic aspects of bipartite graphs.
Bakonyi, Mihály, Varness, Erik M. (1995)
International Journal of Mathematics and Mathematical Sciences
Similarity:
Matchings in hexagonal cacti.
Farrell, E.J. (1987)
International Journal of Mathematics and Mathematical Sciences
Similarity:
On the reconstruction of the matching polynomial and the reconstruction conjecture.
Farrell, E.J., Wahid, S.A. (1987)
International Journal of Mathematics and Mathematical Sciences
Similarity:
On the number of dissimilar pfaffian orientations of graphs
Marcelo H. de Carvalho, Cláudio L. Lucchesi, U. S. R. Murty (2005)
RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications
Similarity:
Graph drawing in motion.
Friedrich, Carsten, Eades, Peter (2002)
Journal of Graph Algorithms and Applications
Similarity: