Sciweavers

677 search results - page 18 / 136
» Bipartite roots of graphs
Sort
View
COMBINATORICS
2007
42views more  COMBINATORICS 2007»
13 years 7 months ago
Graphs with Chromatic Roots in the Interval (1, 2)
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...
Gordon F. Royle
JCT
2008
68views more  JCT 2008»
13 years 7 months ago
Pseudo 2-factor isomorphic regular bipartite graphs
A graph is pseudo 2
Marien Abreu, A. A. Diwan, Bill Jackson, Domenico ...
CORR
2008
Springer
110views Education» more  CORR 2008»
13 years 7 months ago
Perfect Matchings via Uniform Sampling in Regular Bipartite Graphs
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),...
Ashish Goel, Michael Kapralov, Sanjeev Khanna
SIAMDM
2008
122views more  SIAMDM 2008»
13 years 7 months ago
Cycle Systems in the Complete Bipartite Graph Plus a One-Factor
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...
Liqun Pu, Hao Shen, Jun Ma, San Ling
ORL
2007
82views more  ORL 2007»
13 years 7 months ago
The path partition problem and related problems in bipartite graphs
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...
Jérôme Monnot, Sophie Toulouse