Chromatic index under parameterized settings

DOI10.1007/978-3-032-11835-6_7MaRDI QIDQ7294423zbMATH OpenFDO

Authors Sriram Bhyravarapu, Soumen Mandal, Ashutosh Rai, Saket Saurabh, Shaily Verma

Publication date 10 July 2026

Full work available at URL https://doi.org/10.1007/978-3-032-11835-6_7

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10)

Cites work

• A polynomial time algorithm for strong edge coloring of partial \(k\)-trees
• Computing and Combinatorics
• Cross-composition: a new technique for kernelization lower bounds
• Edge and total coloring of interval graphs
• Edge-coloring of split graphs.
• Edge-Coloring Partialk-Trees
• scientific article; zbMATH DE number 3639144 (Why is no real title available?)
• scientific article; zbMATH DE number 749267 (Why is no real title available?)
• scientific article; zbMATH DE number 3273761 (Why is no real title available?)
• New results on edge-coloring and total-coloring of split graphs
• On an estimate of the chromatic class of a \(p\)-graph
• Parameterized algorithms
• Planar graphs of maximum degree seven are Class I
• Polynomial algorithms for graph isomorphism and chromatic index on partial k-trees
• Revising Johnson's table for the 21st century
• Short Shop Schedules
• Switch scheduling via randomized edge coloring
• The chromatic index of split-interval graphs
• The NP-Completeness of Edge-Coloring
• The total chromatic number of split-indifference graphs
• Über Graphen und ihre Anwendung auf Determinantentheorie und Mengenlehre.

This page was built for publication: Chromatic index under parameterized settings

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