496 search results - page 2 / 100 » C4-saturated bipartite graphs |
COCO
2004
Springer
13 years 11 months ago
2004
Springer
We consider the problem of testing bipartiteness in the adjacency matrix model. The best known algorithm, due to Alon and Krivelevich, distinguishes between bipartite graphs and g...
ENDM
2010
13 years 5 months ago
2010
Galvin solved the Dinitz conjecture by proving that bipartite graphs are -edge-choosable. We employ Galvin's method to show some further list edgecolouring properties of bipa...
IWOCA
2009
Springer
13 years 10 months ago
2009
Springer
R. H¨aggkvist proved that every 3-regular bipartite graph of order 2n with no component isomorphic to the Heawood graph decomposes the complete bipartite graph K6n,6n. In [2] the ...
WG
2007
Springer
13 years 11 months ago
2007
Springer
We study a variation of the vertex cover problem where it is required that the graph induced by the vertex cover is connected. We prove that this problem is polynomial in chordal g...
CORR
2010
Springer
13 years 5 months ago
2010
Springer
Whiteley [9] gives a complete characterization of the infinitesimal flexes of complete bipartite frameworks. Our work generalizes a specific infinitesimal flex to include joined gr...