Pages that link to "Item:Q4429678"
From MaRDI portal
The following pages link to The 3-Colorability Problem on Graphs with Maximum Degree Four (Q4429678):
Displaying 25 items.
- Vertex coloring of graphs with few obstructions (Q344868) (← links)
- Brooks' theorem for generalized dart graphs (Q413285) (← links)
- The coloring problem for classes with two small obstructions (Q479257) (← links)
- Updating the complexity status of coloring graphs without a fixed induced linear forest (Q764301) (← links)
- Colouring vertices of triangle-free graphs without forests (Q764907) (← links)
- Exact complexity of exact-four-colorability (Q1014384) (← links)
- The complexity of some problems related to GRAPH 3-COLORABILITY (Q1281385) (← links)
- On the NP-completeness of the \(k\)-colorability problem for triangle-free graphs (Q1356685) (← links)
- 3-colorability \(\in \mathcal P\) for \(P_{6}\)-free graphs. (Q1427186) (← links)
- Three colorability characterized by shrinking of locally connected subgraphs into triangles (Q1708265) (← links)
- Solving problems on graphs of high rank-width (Q1709595) (← links)
- Oriented colourings of graphs with maximum degree three and four (Q1727768) (← links)
- On 3-colouring of graphs with short faces and bounded maximum vertex degree (Q2030141) (← links)
- Coloring vertices of claw-free graphs in three colors (Q2251141) (← links)
- The complexity of the 3-colorability problem in the absence of a pair of small forbidden induced subgraphs (Q2352049) (← links)
- NP-hard graph problems and boundary classes of graphs (Q2465640) (← links)
- Dichotomy for Coloring of Dart Graphs (Q3000496) (← links)
- Colouring Vertices of Triangle-Free Graphs (Q3057624) (← links)
- On the number of boundary classes in the 3-colouring problem (Q3225901) (← links)
- Solving Problems on Graphs of High Rank-Width (Q3449829) (← links)
- (Q3514492) (← links)
- On the density of 2-colorable 3-graphs in which any four points span at most two edges (Q3576967) (← links)
- On the complexity for constructing a 3-colouring for planar graphs with short facets (Q5213298) (← links)
- Between 2- and 3-colorability (Q5902303) (← links)
- On 3-degree 4-chordal graphs (Q6174132) (← links)
