On Path Factors of (3, 4)-Biregular Bigraphs

@article{Asratian2008OnPF,
  title={On Path Factors of (3, 4)-Biregular Bigraphs},
  author={Armen S. Asratian and Carl Johan Casselgren},
  journal={Graphs and Combinatorics},
  year={2008},
  volume={24},
  pages={405-411}
}
A (3, 4)-biregular bigraph G is a bipartite graph where all vertices in one part have degree 3 and all vertices in the other part have degree 4. A path factor of G is a spanning subgraph whose components are nontrivial paths. We prove that a simple (3, 4)-biregular bigraph always has a path factor such that the endpoints of each path have degree three. Moreover we suggest a polynomial algorithm for the construction of such a path factor. 

Topics from this paper.

References

Publications referenced by this paper.
SHOWING 1-10 OF 23 REFERENCES

Some results on interval edge colorings of bipartite graphs, Master’s Thesis, Linköping

  • C. J. Casselgren
  • 2005
1 Excerpt

Consecutive edge - colorings of complete and incomplete Cartesian products of graphs

  • M. Kubale Giaro
  • Discrete Appl . Math .
  • 2004

On interval colorings of planar graphs

  • M. A. Axenovich
  • Proc. 33rd Southeastern Intl. Conf. Combin…
  • 2002
1 Excerpt

Similar Papers

Loading similar papers…