Edge disjoint caterpillar realizations
暂无分享,去创建一个
Istv'an Mikl'os | Geneva Schlafly | Yuheng Wang | Zhangyang Wei | Istv'an Mikl'os | Yuheng Wang | Geneva Schlafly | Zhangyang Wei
[1] O. Ore. Note on Hamilton Circuits , 1960 .
[2] Colin McDiarmid,et al. Colour degree matrices of graphs with at most one cycle , 2016, Discret. Appl. Math..
[3] Dominique de Werra,et al. Degree-constrained edge partitioning in graphs arising from discrete tomography , 2009, J. Graph Algorithms Appl..
[4] G. Herman,et al. Discrete tomography : foundations, algorithms, and applications , 1999 .
[5] Sukhamay Kundu,et al. Disjoint Representation of Three Tree Realizable Sequences. I , 1975 .
[6] Zoltán Király,et al. Packing tree degree sequences , 2019, Informatica.
[7] István Miklós,et al. Packing Tree Degree Sequences , 2020, Graphs Comb..
[8] E. M. Palmer,et al. The Hidden Algorithm of Ore's Theorem on Hamiltonian Cycles , 1997 .
[9] Sukhamay Kundu. Disjoint Representation of Tree Realizable Sequences , 1974 .
[10] G. Herman,et al. Advances in discrete tomography and its applications , 2007 .