Pólya's permanent problem.
McCuaig, William (2004)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
Displaying similar documents to “Strongly maximal matchings in infinite graphs.”
Pólya's permanent problem.
Graphical condensation, overlapping Pfaffians and superpositions of matchings.
Fulmek, Markus (2010)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
Perfect matching preservers.
Brualdi, Richard A., Loebl, Martin, Pangrác, Ondřej (2006)
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:
Edge Dominating Sets and Vertex Covers
Ronald Dutton, William F. Klostermeyer (2013)
Discussiones Mathematicae Graph Theory
Similarity:
Bipartite graphs with equal edge domination number and maximum matching cardinality are characterized. These two parameters are used to develop bounds on the vertex cover and total vertex cover numbers of graphs and a resulting chain of vertex covering, edge domination, and matching parameters is explored. In addition, the total vertex cover number is compared to the total domination number of trees and grid graphs.
Analoga of Menger's theorem for polar and polarized graphs
Bohdan Zelinka (1976)
Czechoslovak Mathematical Journal
Similarity:
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 a problem of Marco Buratti.
Horak, Peter, Rosa, Alexander (2009)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
Long path lemma concerning connectivity and independence number.
Fujita, Shinya, Halperin, Alexander, Magnant, Colton (2011)
The Electronic Journal of Combinatorics [electronic only]
Similarity: