scientific article; zbMATH DE number 7651161
From MaRDI portal
Publication:5874489
Cites work
- scientific article; zbMATH DE number 3639144 (Why is no real title available?)
- scientific article; zbMATH DE number 2044943 (Why is no real title available?)
- scientific article; zbMATH DE number 2159660 (Why is no real title available?)
- A Linear-Time Algorithm for Finding Tree-Decompositions of Small Treewidth
- A survey on the computational complexity of coloring graphs with forbidden subgraphs
- Acyclic and star colorings of cographs
- Acyclic coloring of graphs
- Acyclic coloring of graphs of maximum degree five: nine colors are enough
- Acyclic coloring with few division vertices
- Acyclically 3-colorable planar graphs
- Acyclically 4-colorable triangulations
- Algorithmic aspects of acyclic edge colorings
- Approximations for -Colorings of Graphs
- Classifying \(k\)-edge colouring for \(H\)-free graphs
- Coloring edges and vertices of graphs without short or long cycles
- Coloring graphs without short cycles and long induced paths
- Coloring with no 2-colored \(P_4\)'s
- Colouring (P_r+P_s)-Free Graphs
- Disjoint triangles of a cubic line graph
- Distance three labelings of trees
- Fixed-parameter complexity of \(\lambda\)-labelings
- Frugal, acyclic and star colourings of graphs
- Graph Theory and Probability
- Independent feedback vertex set for \(P_5\)-free graphs
- Linear time algorithm for computing a small biclique in graphs without long induced paths
- Minimum feedback vertex set and acyclic coloring.
- NP completeness of finding the chromatic index of regular graphs
- On Injective Colourings of Chordal Graphs
- On acyclic colorings of planar graphs
- On the complexity of injective colorings and its generalizations
- On the computational complexity of strong edge coloring
- On the injective chromatic number of graphs
- Parameterized complexity of coloring problems: treewidth versus vertex cover
- Paw-free graphs
- Planarization and acyclic colorings of subcubic claw-free graphs
- Restricted coloring problems on graphs with few \(P_4\)'s
- Star Chromatic Index
- Star chromatic index of subcubic multigraphs
- Star coloring of certain graph classes
- Star coloring of graphs
- The Cyclic Coloring Problem and Estimation of Sparse Hessian Matrices
- The NP-Completeness of Edge-Coloring
- The four-colour theorem
- The monadic second-order logic of graphs. I: Recognizable sets of finite graphs
- Uniquely Colourable Graphs and the Hardness of Colouring Graphs of Large Girth
- Updating the complexity status of coloring graphs without a fixed induced linear forest
Cited in
(9)- Star colouring of bounded degree graphs and regular graphs
- Hardness transitions and uniqueness of acyclic colouring
- Injective colouring for H-free graphs
- Acyclic, star, and injective colouring: bounding the diameter
- On the complexity of reconstructing H-free graphs from their Star Systems
- Acyclic, star, and injective colouring: bounding the diameter
- The complexity of star colouring in bounded degree graphs and regular graphs
- Acyclic, Star and Injective Colouring: A Complexity Picture for H-Free Graphs
- The complexity of \(L(p, q)\)-edge-labelling
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5874489)
