Color-critical Graphs and Hereditary Hypergraphs - Archive ouverte HAL Accéder directement au contenu
Pré-Publication, Document De Travail Année : 2019

Color-critical Graphs and Hereditary Hypergraphs

András Sebő
  • Fonction : Auteur
  • PersonId : 739877
  • IdHAL : sebo

Résumé

A quick proof of Gallai's celebrated theorem on color-critical graphs is given from Gallai's simple, ingenious lemma on factor-critical graphs, in terms of partitioning the vertex-set into a minimum number of hyperedges of a hereditary hypergraph, generalizing the chromatic number. We then show examples of applying the results to new problems and indicate the way to algorithms and refined complexity results for all these examples at the same time.

Dates et versions

hal-02860419 , version 1 (08-06-2020)

Identifiants

Citer

András Sebő. Color-critical Graphs and Hereditary Hypergraphs. 2019. ⟨hal-02860419⟩
15 Consultations
0 Téléchargements

Altmetric

Partager

Gmail Facebook X LinkedIn More