On structural parameterizations of star coloring
From MaRDI portal
Publication:6132531
DOI10.1007/978-3-031-25211-2_12arXiv2211.12226OpenAlexW4318023097MaRDI QIDQ6132531
Sriram Bhyravarapu, I. Vinod Reddy
Publication date: 17 August 2023
Published in: Algorithms and Discrete Applied Mathematics (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/2211.12226
Related Items
On structural parameterizations of star coloring ⋮ Spanning trees with few branch vertices in graphs of bounded neighborhood diversity
Cites Work
- Unnamed Item
- Unnamed Item
- Acyclic and star colorings of cographs
- Graph minors. I. Excluding a forest
- An application of simultaneous diophantine approximation in combinatorial optimization
- Algorithmic meta-theorems for restrictions of treewidth
- Coloring with no 2-colored \(P_4\)'s
- Linear time solvable optimization problems on graphs of bounded clique-width
- Upper bounds to the clique width of graphs
- A polynomial time algorithm to find the star chromatic index of trees
- Efficient Computation of Sparse Hessians Using Coloring and Automatic Differentiation
- Integer Programming with a Fixed Number of Variables
- Estimation of Sparse Jacobian Matrices and Graph Coloring Blems
- Intractability of Clique-Width Parameterizations
- Estimation of sparse hessian matrices and graph coloring problems
- Minkowski's Convex Body Theorem and Integer Programming
- The monadic second-order logic of graphs III : tree-decompositions, minors and complexity issues
- Star chromatic index of subcubic multigraphs
- Parameterized Algorithms
- Parameterized Pre-Coloring Extension and List Coloring Problems
- Acyclic colorings of planar graphs
- The complexity of star colouring in bounded degree graphs and regular graphs
- On structural parameterizations of star coloring
This page was built for publication: On structural parameterizations of star coloring
