677 search results - page 18 / 136 » Bipartite roots of graphs |
68
Voted
COMBINATORICS
2007
15 years 14 days ago
2007
We present an infinite family of 3-connected non-bipartite graphs with chromatic roots in the interval (1, 2) thus resolving a conjecture of Jackson’s in the negative. In addit...
74
Voted
JCT
2008
15 years 13 days ago
2008
A graph is pseudo 2
CORR
2008
Springer
15 years 16 days ago
2008
Springer
In this paper we further investigate the well-studied problem of finding a perfect matching in a regular bipartite graph. The first non-trivial algorithm, with running time O(mn),...
102
click to vote
SIAMDM
2008
15 years 11 days ago
2008
Let Kn,n denote the complete bipartite graph with n vertices in each partite set and Kn,n +I denote Kn,n with a 1-factor added. It is proved in this paper that there exists an m-c...
102
Voted
ORL
2007
14 years 12 months ago
2007
We prove that it is NP-complete to decide whether a bipartite graph of maximum degree three on nk vertices can be partitioned into n paths of length k. Finally, we propose some ap...