Pages that link to "Item:Q2506359"

The following pages link to Hard coloring problems in low degree planar bipartite graphs (Q2506359):

Displaying 19 items.

• Coloring graphs characterized by a forbidden subgraph (Q476308) (← links)
• Complexity of two coloring problems in cubic planar bipartite mixed graphs (Q968180) (← links)
• Precoloring extension. I: Interval graphs (Q1198648) (← links)
• Total colouring regular bipartite graphs is NP-hard (Q1313834) (← links)
• On some coloring problems in grids (Q1939251) (← links)
• On list \(k\)-coloring convex bipartite graphs (Q2056881) (← links)
• Colouring generalized claw-free graphs and graphs of large girth: bounding the diameter (Q2167905) (← links)
• A complexity dichotomy for critical values of the \(b\)-chromatic number of graphs (Q2310757) (← links)
• The maximum \(k\)-differential coloring problem (Q2407949) (← links)
• On two coloring problems in mixed graphs (Q2426450) (← links)
• Open Problems on Graph Coloring for Special Graph Classes (Q2827799) (← links)
• Filling the complexity gaps for colouring planar and bounded degree graphs (Q3299212) (← links)
• NP completeness of the edge precoloring extension problem on bipartite graphs (Q4406072) (← links)
• (Q4940090) (← links)
• Colouring H-free graphs of bounded diameter. (Q5092372) (← links)
• A complexity dichotomy for critical values of the b-chromatic number of graphs (Q5092395) (← links)
• On the complexity for constructing a 3-colouring for planar graphs with short facets (Q5213298) (← links)
• NP‐completeness of list coloring and precoloring extension on the edges of planar graphs (Q5311921) (← links)
• Solving problems on generalized convex graphs via mim-width (Q6183361) (← links)