Pages that link to "Item:Q4978449"
From MaRDI portal
The following pages link to Coloring Graphs with Constraints on Connectivity (Q4978449):
Displaying 14 items.
- Hard-to-color graphs for connected sequential colorings (Q1329800) (← links)
- Partitioning sparse graphs into an independent set and a forest of bounded degree (Q1753010) (← links)
- A Brooks type theorem for the maximum local edge connectivity (Q1753016) (← links)
- Coloring hypergraphs of low connectivity (Q2073648) (← links)
- A complexity dichotomy for critical values of the \(b\)-chromatic number of graphs (Q2310757) (← links)
- Coloring \(k\)-colorable graphs using smaller palettes (Q2768312) (← links)
- Open Problems on Graph Coloring for Special Graph Classes (Q2827799) (← links)
- (Q3220612) (← links)
- Four Shorts Stories on Surprising Algorithmic Uses of Treewidth (Q5042454) (← links)
- A Subexponential Parameterized Algorithm for Directed Subset Traveling Salesman Problem on Planar Graphs (Q5071089) (← links)
- A complexity dichotomy for critical values of the b-chromatic number of graphs (Q5092395) (← links)
- Tight Bounds for Planar Strongly Connected Steiner Subgraph with Fixed Number of Terminals (and Extensions) (Q5221061) (← links)
- A Tight Lower Bound for Edge-Disjoint Paths on Planar DAGs (Q6158361) (← links)
- Properties of uniformly \(3\)-connected graphs (Q6599816) (← links)
