Fast FPT algorithms for Grundy number on dense graphs

DOI10.1007/978-3-031-83438-7_14MaRDI QIDQ6969499zbMATH OpenFDO

Authors Sina Ghasemi Nezhad, Maryam Moghaddas, Fahad Panolan

Publication date 20 June 2025

Full work available at URL https://doi.org/10.1007/978-3-031-83438-7_14

zbMATH Keywords

cluster graphsfixed-parameter tractable (FPT) algorithmsGrundy coloringinteger programmax flow

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Algorithms in computer science (68Wxx)

Cites work

• A new approach to the maximum-flow problem
• Algorithms for Vertex Partitioning Problems on Partial k-Trees
• Complexity of Grundy coloring and its variants
• Grundy Coloring and friends, half-graphs, bicliques
• Grundy Distinguishes Treewidth from Pathwidth
• scientific article; zbMATH DE number 2147949 (Why is no real title available?)
• scientific article; zbMATH DE number 3800939 (Why is no real title available?)
• On the Grundy and b-chromatic numbers of a graph
• Some perfect coloring properties of graphs

This page was built for publication: Fast FPT algorithms for Grundy number on dense graphs

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