A new minimal chordal completion
Combinatorics
2018-10-15 v1
Abstract
In this paper, we present a minimal chordal completion of a graph satisfying the inequality for the non-chordality index of . In terms of our chordal completions, we partially settle the Hadwiger conjecture and the Erd\H{o}s-Faber-Lov\'{a}sz Conjecture, and extend the known -bounded class by adding to it the family of graphs with bounded non-chordality indices.
Keywords
Cite
@article{arxiv.1810.05280,
title = {A new minimal chordal completion},
author = {Jihoon Choi and Soogang Eoh and Suh-Ryung Kim},
journal= {arXiv preprint arXiv:1810.05280},
year = {2018}
}