Algorithmic aspects of bipartite graphs.
Bakonyi, Mihály, Varness, Erik M. (1995)
International Journal of Mathematics and Mathematical Sciences
Similarity:
Bakonyi, Mihály, Varness, Erik M. (1995)
International Journal of Mathematics and Mathematical Sciences
Similarity:
Samuel Jezný, Marián Trenkler (1983)
Czechoslovak Mathematical Journal
Similarity:
Ľ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.
Marcelo H. de Carvalho, Cláudio L. Lucchesi, U. S. R. Murty (2005)
RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications
Similarity:
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...
Liu, Guizhen, Qian, Jianbo, Sun, Jonathan Z., Xu, Rui (2008)
International Journal of Mathematics and Mathematical Sciences
Similarity:
André Bouchet (1999)
Annales de l'institut Fourier
Similarity:
The following result is proved: if a bipartite graph is not a circle graph, then its complement is not a circle graph. The proof uses Naji’s characterization of circle graphs by means of a linear system of equations with unknowns in . At the end of this short note I briefly recall the work of François Jaeger on circle graphs.