Multicriterial graph problems with MAXMIN criterion
From MaRDI portal
Publication:3115277
Recommendations
Cited in
(68)- Hall number for list colorings of graphs: Extremal results
- Improper choosability of graphs embedded on the surface of genus r
- Injective colorings of sparse graphs
- On the multicriterial problem of the search for optimal sources in a graph
- Hard coloring problems in low degree planar bipartite graphs
- On a list-coloring problem
- On a two-criterion problem on graphs
- Application of polynomial method to on-line list colouring of graphs
- A not 3-choosable planar graph without 3-cycles
- On \(b\)-colorings in regular graphs
- The 4-choosability of plane graphs without 4-cycles
- A smaller planar graph without 4-, 5-cycles and intersecting triangles that is not 3-choosable
- The 4-choosability of toroidal graphs without intersecting triangles
- Extremal graphs for the list-coloring version of a theorem of Nordhaus and Gaddum
- Entire choosability of near-outerplane graphs
- The 3-choosability of plane graphs of girth 4
- A relation between choosability and uniquely list colorability
- Contractibility and the Hadwiger conjecture
- List total arboricity of 2-degenerate graphs
- scientific article; zbMATH DE number 3906239 (Why is no real title available?)
- Graph imperfection. I
- Graphs with bounded maximum average degree and their neighbor sum distinguishing total-choice numbers
- Ohba's conjecture is true for graphs with independence number at most three
- Another proof of the 5-choosability of \(K_5\)-minor-free graphs
- Choice number of complete multipartite graphs \(K_{3*3,2*(k - 5),1*2}\) and \(K_{4,3*2,2*(k - 6),1*3}\)
- List edge and list total colourings of multigraphs
- On \((3, 1)^\ast\)-choosability of planar graphs without adjacent short cycles
- scientific article; zbMATH DE number 4099071 (Why is no real title available?)
- List vertex-arboricity of toroidal graphs without 4-cycles adjacent to 3-cycles
- Choosability, edge choosability and total choosability of outerplane graphs
- On two generalizations of the Alon-Tarsi polynomial method
- A note on list improper coloring planar graphs
- Vertex coloring complete multipartite graphs from random lists of size 2
- Coloring graphs from random lists of size 2
- Amenable colorings
- Edge-choosability in line-perfect multigraphs
- DP-colorings of graphs with high chromatic number
- Choosability of K₅-minor-free graphs
- Coloring face-hypergraphs of graphs on surfaces
- On structure of some plane graphs with application to choosability
- Linear choosability of sparse graphs
- A subexponential algorithm for the coloured tree partition problem
- Online containers for hypergraphs, with applications to linear equations
- Planar graphs without intersecting 5-cycles are 4-choosable
- Dense uniform hypergraphs have high list chromatic number
- Sufficient sparseness conditions for \(G^2\) to be \((\Delta + 1)\)-choosable, when \(\Delta \geq 5\)
- Choosability and fractional chromatic numbers
- Complexity of clique coloring and related problems
- Generalized list \(T\)-colorings of cycles
- On choosability of some complete multipartite graphs and Ohba's conjecture
- Choosability of planar graphs
- Improper choosability of graphs of nonnegative characteristic
- List precoloring extension in planar graphs
- On 3-choosable planar graphs of girth at least 4
- Complexity of unique list colorability
- Precoloring extension for 2-connected graphs with maximum degree three
- Planar graphs without 3-, 7-, and 8-cycles are 3-choosable
- The colour theorems of Brooks and Gallai extended
- On the choice number of complete multipartite graphs with part size four
- Edge choosability of planar graphs without 5-cycles with a chord
- On the complexity of a restricted list-coloring problem
- The complexity of planar graph choosability
- Linear choosability of graphs
- Upper bounds for the achromatic and coloring numbers of a graph
- Simultaneously colouring the edges and faces of plane graphs
- \(T\)-choosability in graphs
- Complexity of choosing subsets from color sets
- A sufficient condition for a planar graph to be 4-choosable
This page was built for publication: Multicriterial graph problems with MAXMIN criterion
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3115277)
