[PDF][PDF] Forcing on perfect matchings-A survey
Z Che, Z Chen - MATCH Commun. Math. Comput. Chem, 2011 - match.pmf.kg.ac.rs
The notions of a forcing edge and the forcing number of a perfect matching first appeared in
a 1991 paper [15] by Harary, Klein and Zivkovic. The root of these concepts can be traced to …
a 1991 paper [15] by Harary, Klein and Zivkovic. The root of these concepts can be traced to …
[HTML][HTML] Forcing faces in plane bipartite graphs
Z Che, Z Chen - Discrete mathematics, 2008 - Elsevier
Let Ω denote the class of connected plane bipartite graphs with no pendant edges. A finite
face s of a graph G∈ Ω is said to be a forcing face of G if the subgraph of G obtained by …
face s of a graph G∈ Ω is said to be a forcing face of G if the subgraph of G obtained by …
General concepts of graphs
S Bau - arXiv preprint arXiv:0706.1835, 2007 - arxiv.org
A little general abstract combinatorial nonsense delivered in this note is a presentation of
some old and basic concepts, central to discrete mathematics, in terms of new words. The …
some old and basic concepts, central to discrete mathematics, in terms of new words. The …