Perfect matching preservers.
Brualdi, Richard A., Loebl, Martin, Pangrác, Ondřej (2006)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
Displaying similar documents to “Pólya's permanent problem.”
Perfect matching preservers.
On the dimer problem and the Ising problem in finite 3-dimensional lattices.
Loebl, Martin (2002)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
On the theory of Pfaffian orientations. I: Perfect matchings and permanents.
Gallucio, Anna, Loebl, Martin (1999)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
Permanents, Pfaffian orientations, and even directed circuits.
Robertson, Neil, Seymour, P.D., Thomas, Robin (1999)
Annals of Mathematics. Second Series
Similarity:
Graphical condensation, overlapping Pfaffians and superpositions of matchings.
Fulmek, Markus (2010)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
Paths through fixed vertices in edge-colored graphs
W. S. Chou, Y. Manoussakis, O. Megalakaki, M. Spyratos, Zs. Tuza (1994)
Mathématiques et Sciences Humaines
Similarity:
We study the problem of finding an alternating path having given endpoints and passing through a given set of vertices in edge-colored graphs (a path is alternating if any two consecutive edges are in different colors). In particular, we show that this problem in NP-complete for 2-edge-colored graphs. Then we give a polynomial characterization when we restrict ourselves to 2-edge-colored complete graphs. We also investigate on (s,t)-paths through fixed vertices, i.e. paths of length...
Lattice structures from planar graphs.
Felsner, Stefan (2004)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
On some Ramsey and Turán-type numbers for paths and cycles.
Dzido, Tomasz, Kubale, Marek, Piwakowski, Konrad (2006)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
Strongly maximal matchings in infinite graphs.
Aharoni, Ron, Berger, Eli, Georgakopoulos, Agelos, Sprussel, Philipp (2008)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
Existence of perfect matchings in a plane bipartite graph
Zhongyuan Che (2010)
Czechoslovak Mathematical Journal
Similarity:
We give a necessary and sufficient condition for the existence of perfect matchings in a plane bipartite graph in terms of elementary edge-cut, which extends the result for the existence of perfect matchings in a hexagonal system given in the paper of F. Zhang, R. Chen and X. Guo (1985).