Algorithmic aspects of bipartite graphs.
Bakonyi, Mihály, Varness, Erik M. (1995)
International Journal of Mathematics and Mathematical Sciences
Similarity:
Displaying similar documents to “Several results on chordal bipartite graphs”
Algorithmic aspects of bipartite graphs.
Characterization of magic graphs
Samuel Jezný, Marián Trenkler (1983)
Czechoslovak Mathematical Journal
Similarity:
On a generalization of perfect -matching
Ľubica Šándorová, Marián Trenkler (1991)
Mathematica Bohemica
Similarity:
The paper is concerned with the existence of non-negative or positive solutions to , where is the vertex-edge incidence matrix of an undirected graph. The paper gives necessary and sufficient conditions for the existence of such a solution.
On the number of dissimilar pfaffian orientations of graphs
Marcelo H. de Carvalho, Cláudio L. Lucchesi, U. S. R. Murty (2005)
RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications
Similarity:
1-factors and characterization of reducible faces of plane elementary bipartite graphs
Andrej Taranenko, Aleksander Vesel (2012)
Discussiones Mathematicae Graph Theory
Similarity:
As a general case of molecular graphs of benzenoid hydrocarbons, we study plane bipartite graphs with Kekulé structures (1-factors). A bipartite graph G is called elementary if G is connected and every edge belongs to a 1-factor of G. Some properties of the minimal and the maximal 1-factor of a plane elementary graph are given. A peripheral face f of a plane elementary graph is reducible, if the removal of the internal vertices and edges of the path that is the intersection...