Pages that link to "Item:Q4210665"
From MaRDI portal
The following pages link to Graph colorings with local constraints -- a survey (Q4210665):
Displaying 50 items.
- Ohba's conjecture is true for graphs \(K_{t+2,3,2\ast(k-t-2),1\ast t}\) (Q277100) (← links)
- Complexity of coloring graphs without paths and cycles (Q344861) (← links)
- Data reduction for graph coloring problems (Q393081) (← links)
- Colouring of graphs with Ramsey-type forbidden subgraphs (Q393895) (← links)
- Application of polynomial method to on-line list colouring of graphs (Q412279) (← links)
- Determining the chromatic number of triangle-free \(2P_3\)-free graphs in polynomial time (Q417995) (← links)
- On the parameterized complexity of coloring graphs in the absence of a linear forest (Q450579) (← links)
- Beyond Ohba's conjecture: a bound on the choice number of \(k\)-chromatic graphs with \(n\) vertices (Q458608) (← links)
- Coloring graphs characterized by a forbidden subgraph (Q476308) (← links)
- Orientations of graphs with prescribed weighted out-degrees (Q489364) (← links)
- Improved complexity results on \(k\)-coloring \(P_t\)-free graphs (Q499486) (← links)
- Two complexity results for the vertex coloring problem (Q505438) (← links)
- Upper bounds for the achromatic and coloring numbers of a graph (Q516843) (← links)
- WORM colorings of planar graphs (Q521753) (← links)
- Parameterized complexity of coloring problems: treewidth versus vertex cover (Q534566) (← links)
- On the complexity of some colorful problems parameterized by treewidth (Q627124) (← links)
- Consensus models: computational complexity aspects in modern approaches to the list coloring problem (Q638544) (← links)
- Chromatic-choosability of hypergraphs with high chromatic number (Q668048) (← links)
- Planar graphs without cycles of specific lengths (Q697075) (← links)
- Randić index and coloring number of a graph (Q741549) (← links)
- Updating the complexity status of coloring graphs without a fixed induced linear forest (Q764301) (← links)
- Using mixed graph coloring to minimize total completion time in job shop scheduling (Q858768) (← links)
- Some recent progress and applications in graph minor theory (Q878052) (← links)
- Time slot scheduling of compatible jobs (Q880586) (← links)
- Distance constraints in graph color extensions (Q885289) (← links)
- Linear choosability of graphs (Q932648) (← links)
- Complexity of unique list colorability (Q935144) (← links)
- Locally planar graphs are 5-choosable (Q958683) (← links)
- Hall number for list colorings of graphs: Extremal results (Q960954) (← links)
- Precoloring extension of co-Meyniel graphs (Q995757) (← links)
- From a zoo to a zoology: Towards a general theory of graph polynomials (Q1015377) (← links)
- Ohba's conjecture is true for graphs with independence number at most three (Q1023085) (← links)
- Some results on \((a:b)\)-choosability (Q1025484) (← links)
- Complexity results for minimum sum edge coloring (Q1028432) (← links)
- List edge multicoloring in graphs with few cycles (Q1029053) (← links)
- Color-bounded hypergraphs. I: General results (Q1044919) (← links)
- On list critical graphs (Q1044925) (← links)
- The Hall number, the Hall index, and the total Hall number of a graph (Q1293202) (← links)
- A short proof of a conjecture on the \(T_r\)-choice number of even cycles (Q1304486) (← links)
- List colorings and reducibility (Q1372746) (← links)
- Extending graph colorings (Q1569052) (← links)
- Complexity of choosing subsets from color sets (Q1584428) (← links)
- Path choosability of planar graphs (Q1627209) (← links)
- Extending precolorings to distinguish group actions (Q1645056) (← links)
- List colouring of graphs and generalized Dyck paths (Q1690249) (← links)
- Polynomial \(\chi \)-binding functions and forbidden induced subgraphs: a survey (Q1733849) (← links)
- Polyhedral studies of vertex coloring problems: the standard formulation (Q1751160) (← links)
- The maximum saving partition problem (Q1779697) (← links)
- Three-coloring and list three-coloring of graphs without induced paths on seven vertices (Q1786047) (← links)
- Restraints permitting the largest number of colourings (Q1786873) (← links)
