Heuristic method to determine lucky k-polynomials for k-colorable graphs

DOI10.2478/AUSI-2019-0014MaRDI QIDQ2178745zbMATH OpenOpenAlexWikidataFDO

Authors Johan Kok

Publication date 11 May 2020

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

Copyright license Creative Commons Attribution-NonCommercial-NoDerivatives 4.0 International

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 algorithms (graph-theoretic aspects) (05C85) Graph polynomials (05C31) Coloring of graphs and hypergraphs (05C15) Paths and cycles (05C38) Structural characterization of families of graphs (05C75)

Recommendations

• Computation of lucky number of planar graphs is NP-hard
• scientific article; zbMATH DE number 1433954
• A simple and fast heuristic algorithm for edge-coloring of graphs
• Why almost all \(k\)-colorable graphs are easy to color
• On the graceful polynomials of a graph

Cites work

• scientific article; zbMATH DE number 854567 (Why is no real title available?)
• scientific article; zbMATH DE number 3290993 (Why is no real title available?)
• An introduction to the $k$-defect polynomials
• Generalisation of the rainbow neighbourhood number and \(k\)-jump colouring of a graph
• Graph theory with applications
• Rainbow degree-jump coloring of graphs

Cited in

(1)

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

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2178745)