A Property Of The Number Of Perfect Matchings Of A Graph
Ivan Gutman (1991)
Publications de l'Institut Mathématique
Similarity:
Ivan Gutman (1991)
Publications de l'Institut Mathématique
Similarity:
Jinfeng Liu, Xiumei Wang (2014)
Discussiones Mathematicae Graph Theory
Similarity:
A graph is called perfect matching compact (briefly, PM-compact), if its perfect matching graph is complete. Matching-covered PM-compact bipartite graphs have been characterized. In this paper, we show that any PM-compact bipartite graph G with δ (G) ≥ 2 has an ear decomposition such that each graph in the decomposition sequence is also PM-compact, which implies that G is matching-covered
Tomislav Doslić (2005)
Discussiones Mathematicae Graph Theory
Similarity:
It is shown in this note that some matching-related properties of graphs, such as their factor-criticality, regularizability and the existence of perfect 2-matchings, are preserved when iterating Mycielski's construction.
M. Chrobak, S. Poljak (1987)
Applicationes Mathematicae
Similarity:
P. John, H. Sachs, H. Zernitz (1987)
Applicationes Mathematicae
Similarity:
Ivan Gutman (1989)
Publications de l'Institut Mathématique
Similarity:
Igor E. Zverovich (2006)
Discussiones Mathematicae Graph Theory
Similarity:
We solve Open Problem (xvi) from Perfect Problems of Chvátal [1] available at ftp://dimacs.rutgers.edu/pub/perfect/problems.tex: Is there a class C of perfect graphs such that (a) C does not include all perfect graphs and (b) every perfect graph contains a vertex whose neighbors induce a subgraph that belongs to C? A class P is called locally reducible if there exists a proper subclass C of P such that every graph in P contains a local subgraph...
Tošić, Ratko, Vojvodić, Dušan (2000)
Novi Sad Journal of Mathematics
Similarity:
F. Latoon
Similarity:
Hwang, Kyung-Won, Sheikh, Naeem N., Hartke, Stephen G. (2009)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
Lin, Feng-Gen, Zhang, Lian-Zhu (2009)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
Lu, Fuliang, Zhang, Lianzhu, Lin, Fenggen (2010)
The Electronic Journal of Combinatorics [electronic only]
Similarity: