Edge-Disjoint Tree Realization of Tree Degree Matrices that avoid routine induction

Author
Ian Seong
View Count
2072
License
Creative Commons CC BY 4.0
Abstract

Identifying whether a degree matrix has an edge-disjoint realization is an NP-hard problem. In comparison, identifying whether a tree degree matrix has an edge-disjoint realization is easier, but the task is still challenging. In 1975, a sufficient condition for the tree degree matrices with three rows has been found, but the condition has not been improved since. This paper contains an essential part of the proof which improves the sufficient condition.

Edge-Disjoint Tree Realization of Tree Degree Matrices that avoid routine induction