A new minimal chordal completion
Abstract
In this paper, we present a minimal chordal completion G* of a graph G satisfying the inequality ω(G*) - ω(G) i(G) for the non-chordality index i(G) of G. In terms of our chordal completions, we partially settle the Hadwiger conjecture and the Erdos-Faber-Lov\'asz Conjecture, and extend the known -bounded class by adding to it the family of graphs with bounded non-chordality indices.
0
Turn this paper into a lesson
ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.