Pfaffian orientation and enumeration of perfect matchings for some Cartesian products of graphs.
Lin, Feng-Gen, Zhang, Lian-Zhu (2009)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
Displaying similar documents to “A note on pm-compact bipartite graphs”
Pfaffian orientation and enumeration of perfect matchings for some Cartesian products of graphs.
Algorithmic aspects of bipartite graphs.
Bakonyi, Mihály, Varness, Erik M. (1995)
International Journal of Mathematics and Mathematical Sciences
Similarity:
Conditions for β-perfectness
Judith Keijsper, Meike Tewes (2002)
Discussiones Mathematicae Graph Theory
Similarity:
A β-perfect graph is a simple graph G such that χ(G') = β(G') for every induced subgraph G' of G, where χ(G') is the chromatic number of G', and β(G') is defined as the maximum over all induced subgraphs H of G' of the minimum vertex degree in H plus 1 (i.e., δ(H)+1). The vertices of a β-perfect graph G can be coloured with χ(G) colours in polynomial time (greedily). The main purpose of this paper is to give necessary and sufficient conditions, in terms of forbidden...
Choice-Perfect Graphs
Zsolt Tuza (2013)
Discussiones Mathematicae Graph Theory
Similarity:
Given a graph G = (V,E) and a set Lv of admissible colors for each vertex v ∈ V (termed the list at v), a list coloring of G is a (proper) vertex coloring ϕ : V → S v2V Lv such that ϕ(v) ∈ Lv for all v ∈ V and ϕ(u) 6= ϕ(v) for all uv ∈ E. If such a ϕ exists, G is said to be list colorable. The choice number of G is the smallest natural number k for which G is list colorable whenever each list contains at least k colors. In this note we initiate the study of graphs in which the choice...
A Simple Proof of the Perfect Matching Theorem
Ján Plesník (1975)
Matematický časopis
Similarity:
Perfect matching in general vs. cubic graphs : a note on the planar and bipartite cases
E. Bampis, A. Giannakos, A. Karzanov, Y. Manoussakis, I. Milis (2000)
RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications
Similarity:
A Property Of The Number Of Perfect Matchings Of A Graph
Ivan Gutman (1991)
Publications de l'Institut Mathématique
Similarity:
Several results on chordal bipartite graphs
Mihály Bakonyi, Aaron Bono (1997)
Czechoslovak Mathematical Journal
Similarity:
The question of generalizing results involving chordal graphs to similar concepts for chordal bipartite graphs is addressed. First, it is found that the removal of a bisimplicial edge from a chordal bipartite graph produces a chordal bipartite graph. As consequence, occurance of arithmetic zeros will not terminate perfect Gaussian elimination on sparse matrices having associated a chordal bipartite graph. Next, a property concerning minimal edge separators is presented. Finally, it is...