Edge disjoint caterpillar realizations

DOI10.1016/j.dam.2020.11.006zbMath1454.05097arXiv1905.05986OpenAlexW3107580517MaRDI QIDQ2217488

Zhangyang Wei, Yuheng Wang, Geneva Schlafly, István Miklós

Publication date: 29 December 2020

Published in: Discrete Applied Mathematics (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1905.05986

zbMATH Keywords

Hamiltonian pathsdegree sequencesedge disjoint realizations

Mathematics Subject Classification ID

Trees (05C05) Enumeration in graph theory (05C30) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Coloring of graphs and hypergraphs (05C15) Graph labelling (graceful graphs, bandwidth, etc.) (05C78) Eulerian and Hamiltonian graphs (05C45) Vertex degrees (05C07)

Cites Work

• Unnamed Item
• Unnamed Item
• Colour degree matrices of graphs with at most one cycle
• The hidden algorithm of Ore's theorem on Hamiltonian cycles
• Discrete tomography. Foundations, algorithms, and applications
• Packing tree degree sequences
• Advances in discrete tomography and its applications. Some papers based on the presentations at the workshop on discrete tomography and its applications, New York, NY, USA, June 13--15, 2005.
• Note on Hamilton Circuits
• Degree-constrained edge partitioning in graphs arising from discrete tomography
• Disjoint Representation of Three Tree Realizable Sequences. I
• Disjoint Representation of Tree Realizable Sequences

This page was built for publication: Edge disjoint caterpillar realizations