2 search results - page 1 / 1 » Pseudo 2-factor isomorphic regular bipartite graphs |
JCT
2008
15 years 3 months ago
2008
A graph is pseudo 2
134
click to vote
IWOCA
2009
Springer
15 years 7 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 ...