Pages that link to "Item:Q4210665"
From MaRDI portal
The following pages link to Graph colorings with local constraints -- a survey (Q4210665):
Displaying 31 items.
- Extremal jumps of the Hall number (Q3439568) (← links)
- On list coloring Steiner triple systems (Q3578155) (← links)
- Concentration of non‐Lipschitz functions and applications (Q4537624) (← links)
- Coloration de graphes : fondements et applications (Q4809665) (← links)
- The Strong Fractional Choice Number and the Strong Fractional Paint Number of Graphs (Q5048297) (← links)
- List coloring under some graph operations (Q5059492) (← links)
- Colouring (P_r+P_s)-Free Graphs (Q5090995) (← links)
- Colouring H-free graphs of bounded diameter. (Q5092372) (← links)
- List coloring with requests (Q5207462) (← links)
- A Proof of a Conjecture of Ohba (Q5251204) (← links)
- On (4, 2)‐Choosable Graphs (Q5272926) (← links)
- NP‐completeness of list coloring and precoloring extension on the edges of planar graphs (Q5311921) (← links)
- Distance Hereditary Graphs and the Interlace Polynomial (Q5428369) (← links)
- Coloring graphs from lists with bounded size of their union (Q5462386) (← links)
- The last excluded case of Dirac's map‐color theorem for choosability (Q5469029) (← links)
- A broken cycle theorem for the restrained chromatic function (Q5742940) (← links)
- (Q5743487) (← links)
- Parameterized Pre-Coloring Extension and List Coloring Problems (Q5857010) (← links)
- Exploring the complexity boundary between coloring and list-coloring (Q5896984) (← links)
- Exploring the complexity boundary between coloring and list-coloring (Q5899384) (← links)
- Colouring graphs of bounded diameter in the absence of small cycles (Q5918661) (← links)
- Colouring graphs of bounded diameter in the absence of small cycles (Q5925681) (← links)
- On connected list colorings of graphs (Q5954099) (← links)
- Bad list assignments for non‐k $k$‐choosable k $k$‐chromatic graphs with 2k+2 $2k+2$‐vertices (Q6084712) (← links)
- Graph degeneracy and orthogonal vector representations (Q6104068) (← links)
- Slow coloring of \(3k\)-connected graphs (Q6145826) (← links)
- The Alon-Tarsi number of a toroidal grid (Q6171495) (← links)
- Optimal secret share distribution in degree splitting communication networks (Q6186165) (← links)
- Bounds and monotonicity of critical set parameters of colourings (Q6542052) (← links)
- Solving the list coloring problem through a branch-and-price algorithm (Q6586219) (← links)
- On two problems of defective choosability of graphs (Q6657596) (← links)
