On the complexity of coloring ‐graphs

DOI10.1111/itor.12938OpenAlexW3125039068MaRDI QIDQ6092550

Uéverton S. Souza, Unnamed Author, Julliano Rosa Nascimento

Publication date: 23 November 2023

Published in: International Transactions in Operational Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1111/itor.12938

zbMATH Keywords

graph coloringbipartite graphscolorabilityparameterized complexitylist coloring\( ( r, \ell )\)-graph

Mathematics Subject Classification ID

Operations research, mathematical programming (90-XX)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Fundamentals of parameterized complexity
• On the complexity of some colorful problems parameterized by treewidth
• List matrix partitions of chordal graphs
• Generalized coloring for tree-like graphs
• On the (parameterized) complexity of recognizing well-covered (\(r\),\(\ell\))-graph
• Split graphs
• Partitions of graphs into one or two independent sets and cliques
• Parameterized complexity dichotomy for \((r, \ell)\)-\textsc{Vertex Deletion}
• Parametrized complexity theory.
• Complexity of graph partition problems
• On star and biclique edge-colorings
• A survey on vertex coloring problems
• A Coloring Problem With Restrictions of Adjacent Colors
• List Partitions
• Parameterized Algorithms on Perfect Graphs for Deletion to (r,l)-Graphs
• Parameterized Algorithms
• On distance graph coloring problems

This page was built for publication: On the complexity of coloring ‐graphs