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.
New and updated template for writing bachelor thesis reports for the ICT school at KTH. It contains helpful tips for both content and LaTeX syntax.
Must be compiled using XeLaTeX which is available in the settings.
This is not an official template, it does however look like the template provided by the school in word format.