A Family of Perfect Factorisations of Complete Bipartite Graphs

Darryn Bryant, B. M. M., & Wanless, I. M. (2001). A Family of Perfect Factorisations of Complete Bipartite Graphs.

Type

Unclassified

Intellectual base

Unclassified

Year

2001

DOI

10.1006/jcta.2001.3240

Link

https://doi.org/10.1006/jcta.2001.3240

Cited by

1 citation across 1 artifact.

Domain-specific

• Graph factorization
  • … a convenient observable transfers from A one-factorization of a regular graph partitions its edges into perfect matchings and corresponds to a proper edge coloring. to A theorem states simple versus multigraph, parity and regularity assumptions and distinguishes existence of one k-factor from a full k-factorization..

Verification

This reference passed the adversarial substantiation pipeline: it was checked to exist and to support the claim it is attached to. See how references were verified.

Registry ID ref:e5041a630995 · see in the full table