Pages that link to "Item:Q1891685"

The following pages link to Computational complexity of \((2,2)\) path chromatic number problem (Q1891685):

Displaying 10 items.

• On the complexity of deciding whether the distinguishing chromatic number of a graph is at most two (Q626859) (← links)
• Vertex 2-coloring without monochromatic cycles of fixed size is NP-complete (Q730005) (← links)
• The NP-completeness of chromatic index in triangle free graphs with maximum vertex of degree 3 (Q1354146) (← links)
• A note on the complexity of longest path problems related to graph coloring (Q1433224) (← links)
• On monochromatic component size for improper colourings (Q1775062) (← links)
• Combining lithography and directed self assembly for the manufacturing of vias: connections to graph coloring problems, integer programming formulations, and numerical experiments (Q2273901) (← links)
• Minimum \(k\)-path vertex cover (Q2275922) (← links)
• The \(k\)-path coloring problem in graphs of bounded treewidth: an application in integrated circuit manufacturing (Q2661539) (← links)
• The hardness of the functional orientation 2-color problem (Q2848741) (← links)
• On the complexity of the circular chromatic number (Q3159379) (← links)