Sciweavers

Share
13 search results - page 1 / 3
» Note on Bipartite Graph Tilings
Sort
View
SIAMDM
2010
96views more  SIAMDM 2010»
9 years 4 months ago
Note on Bipartite Graph Tilings
Let s < t be two fixed positive integers. We study what are the minimum degree conditions for a bipartite graph G, with both color classes of size n = k(s + t), which ensure t...
Jan Hladký, Mathias Schacht
IPL
2007
130views more  IPL 2007»
9 years 5 months ago
Linear structure of bipartite permutation graphs and the longest path problem
The class of bipartite permutation graphs is the intersection of two well known graph classes: bipartite graphs and permutation graphs. A complete bipartite decomposition of a bip...
Ryuhei Uehara, Gabriel Valiente
IWOCA
2009
Springer
160views Algorithms» more  IWOCA 2009»
9 years 10 months ago
Note on Decomposition of Kn, n into (0, j)-prisms
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 ...
Sylwia Cichacz, Dalibor Froncek, Petr Kovár
DM
2006
101views more  DM 2006»
9 years 5 months ago
Collapsible biclaw-free graphs
A graph is called biclaw-free if it has no biclaw as an induced subgraph. In this note, we prove that if G is a connected bipartite biclaw-free graph with (G) 5, then G is collap...
Hong-Jian Lai, Xiangjuan Yao
COMBINATORICS
2002
93views more  COMBINATORICS 2002»
9 years 5 months ago
On a Theorem of Erdos, Rubin, and Taylor on Choosability of Complete Bipartite Graphs
Erdos, Rubin, and Taylor found a nice correspondence between the minimum order of a complete bipartite graph that is not r-choosable and the minimum number of edges in an r-unifor...
Alexandr V. Kostochka
books