Corpus ID: 155093149

Edge Disjoint Caterpillar Realizations.

@article{Mikls2019EdgeDC,
  title={Edge Disjoint Caterpillar Realizations.},
  author={Istv{\'a}n Mikl{\'o}s and Geneva Schlafly and Yuheng Wang and Zhangyang Wei},
  journal={arXiv: Combinatorics},
  year={2019}
}
  • István Miklós, Geneva Schlafly, +1 author Zhangyang Wei
  • Published 2019
  • Mathematics
  • arXiv: Combinatorics
  • In this paper, we consider the edge disjoint caterpillar realizations of tree degree sequences. We give the necessary and sufficient conditions when two tree degree sequences have edge disjoint caterpillar realizations. We conjecture that an arbitrary number of tree degree sequences have edge disjoint realizations if every vertex is a leaf in at most one tree. We prove that the conjecture is true if the number of tree degree sequences is at most $4$. We also prove that the conjecture is true if… CONTINUE READING

    Figures from this paper.

    References

    Publications referenced by this paper.
    SHOWING 1-9 OF 9 REFERENCES

    Packing tree degree sequences

    VIEW 2 EXCERPTS

    Colour degree matrices of graphs with at most one cycle

    VIEW 1 EXCERPT

    Note on Hamilton Circuits

    VIEW 2 EXCERPTS
    HIGHLY INFLUENTIAL

    Packing tree degree sequences II

    • A. Gollakota, W. Hardt, I. Miklós
    • 2017
    VIEW 1 EXCERPT

    The wonderful Walecki construction

    • B. Alspach
    • Bull. Inst. Combin. Appl.,
    • 2008
    VIEW 2 EXCERPTS