Heuristic method to determine lucky \(k\)-polynomials for \(k\)-colorable graphs

DOI10.2478/ausi-2019-0014zbMath1439.05112OpenAlexW3002022057WikidataQ126304296 ScholiaQ126304296MaRDI QIDQ2178745

Johan Kok

Publication date: 11 May 2020

Published in: Acta Universitatis Sapientiae. Informatica (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.2478/ausi-2019-0014

zbMATH Keywords

chromatic completionlucky 3-polynomialperfect lucky 3-coloring

Mathematics Subject Classification ID

Graph polynomials (05C31) Paths and cycles (05C38) Structural characterization of families of graphs (05C75) Coloring of graphs and hypergraphs (05C15) Graph algorithms (graph-theoretic aspects) (05C85)

Related Items (1)

Stirling number of the fourth kind and lucky partitions of a finite set

Cites Work

• An introduction to the k-defect polynomials
• Rainbow degree-jump coloring of graphs
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Heuristic method to determine lucky \(k\)-polynomials for \(k\)-colorable graphs