Matchings and walks in graphs

Chris Godsil

Type: Article

Publication Date: 1981-09-01

Citations: 116

DOI: https://doi.org/10.1002/jgt.3190050310

View Publication

Locations

Journal of Graph Theory - View

Similar Works

Action	Title	Year	Authors
+	An introduction to matching polynomials	1979	Edward J. Farrell
+	Matchings in graphs II	1975	Paul McCarthy
+	$P$-Matchings in Graphs: A Brief Survey with Some Open Problems	2018	Todd Fenstermacher Soumendra Ganguly Stephen T. Hedetniemi Renu Laskar
+	Chapter 4 The Matching Polynomial and Other Graph Polynomials	1988
+	Counting Matchings and Tree-Like Walks in Regular Graphs	2010	Ian M. Wanless
+	Independent Sets and Matchings	2012	R. Balakrishnan K. Ranganathan
+	Counting Matchings in Graphs	1987	Edward J. Farrell
+	New results relating independence and matchings	2019	Yair Caro Randy Davila Ryan Pepper
+	Matchings in graphs and groups	2018	Adi Jarden Vadim E. Levit Robert Shwartz
+	New results relating independence and matchings.	2019	Yair Caro Randy Davila Ryan Pepper
+	The number of F-matchings in almost every tree is a zero residue	2010	Noga Alon Simi Haber Michael Krivelevich
+	The number of F-matchings in almost every tree is a zero residue	2010	Noga Alon Simi Haber Michael Krivelevich
+	A note on the number of matchings and independent sets in trees	2004	Miranca Fischermann Lutz Volkmann Dieter Rautenbach
+	On the random generation and counting of matchings in dense graphs	1998	Josep Dı́az Marı́a Serna Paul G. Spirakis
+	Random Matchings in Regular Graphs	1998	Jeff Kahn Jeong Han Kim
+	Matchings in regular graphs	1981	Denis Naddef William R. Pulleyblank
+ PDF Chat	New results relating inependence and matchings	2020	Caro Yair Davila Randy Pepper Ryan
+	On matchings and Hamiltonian cycles in random graphs	1989	A. M. Frieze
+	On the theory of the matching polynomial	1981	Chris Godsil Iván Gutman
+	Tree Matchings	2016	Alexander Roberts

Works That Cite This (110)

Action	Title	Year	Authors
+ PDF Chat	Chromatic roots and limits of dense graphs	2016	Péter Csíkvári Péter E. Frenkel Jan Hladký Tamás Hubai
+	Which non-regular bipartite integral graphs with maximum degree four do not have ±1 as eigenvalues?	2004	Krystyna T. Balińska Slobodan K. Simić Krzysztof T. Zwierzyński
+ PDF Chat	Correlation Decay and Partition Function Zeros: Algorithms and Phase Transitions	2022	Jing‐Cheng Liu Alistair Sinclair Piyush Srivastava
+	On immanants of Jacobi-Trudi matrices and permutations with restricted position	1993	Richard P. Stanley John R. Stembridge
+	Counting matchings in irregular bipartite graphs and random lifts	2017	Marc Lelarge
+ PDF Chat	Matchings on infinite graphs	2013	Charles Bordenave Marc Lelarge Justin Salez
+ PDF Chat	On the reconstraction of the matching polynomial and the reconstruction conjecture	1985	Edward J. Farrell Shanaz Wahid
+	On Some Hypergraph Problems of Paul Erdős and the Asymptotics of Matchings, Covers and Colorings	2013	Jeff Kahn
+	Polynomial reconstruction of the matching polynomial	2014	Xueliang Li Yongtang Shi Martin Trinks
+	Growth rates of geometric grid classes of permutations	2013	David Bevan

Works Cited by This (7)

Action	Title	Year	Authors
+	Algebraic Graph Theory	1974	Norman Biggs
+	Spectral conditions for the reconstructibility of a graph	1981	Chris Godsil Brendan D. McKay
+ PDF Chat	A congruence theorem for trees	1957	Paul S. Kelly
+ PDF Chat	Theory of monomer-dimer systems	1972	Ole J. Heilmann Élliott H. Lieb
+	On the theory of the matching polynomial	1981	Chris Godsil Iván Gutman
+	The Acyclic Polynomial Of A Graph	1977	Iván Gutman
+ PDF Chat	Theory of monomer-dimer systems	1972	Ole J. Heilmann Élliott H. Lieb