scientific article; zbMATH DE number 821271
From MaRDI portal
Publication:4857375
Recommendations
Cited in
(only showing first 100 items - show all)- A note on list improper coloring of plane graphs
- Minimum entropy coloring
- 4-chromatic edge critical Grötzsch-Sachs graphs
- Decomposing a planar graph of girth 5 into an independent set and a forest
- Note on coloring graphs without odd-\(K_k\)-minors
- Total colorings and list total colorings of planar graphs without intersecting 4-cycles
- 2-distance \((\varDelta +2)\)-coloring of planar graphs with girth six and \(\varDelta \geq 18\)
- Legal coloring of graphs
- On the hardness of allocating frequencies for hybrid networks
- On the deficiency of bipartite graphs
- Edge-disjoint odd cycles in graphs with small chromatic numbers
- On cyclic colorings and their generalizations
- The harmonious chromatic number of complete \(r\)-ary trees
- The game coloring number of planar graphs
- A strengthening of Brooks' theorem
- On the \(d\)-distance face chromatic number of plane graphs
- Color-critical graphs on a fixed surface
- A note on graph colorings and graph polynomials
- The chromatic number of a graph of girth 5 on a fixed surface
- A new lower bound on the number of edges in colour-critical graphs and hypergraphs
- Coloring graphs with sparse neighborhoods
- The incidentor coloring of multigraphs and its applications
- List-edge-colouring planar graphs with precoloured edges
- The Alon-Tarsi number of planar graphs
- Dynamic \(F\)-free coloring of graphs
- Solving graph coloring problems with the Douglas-Rachford algorithm
- Total colorings of embedded graphs with no 3-cycles adjacent to 4-cycles
- NP-completeness of local colorings of graphs
- The square of a planar cubic graph is 7-colorable
- Cellular adaptive Petri net based on learning automata and its application to the vertex coloring problem
- Spanning quadrangulations of triangulated surfaces
- Planar graphs without 3-cycles adjacent to cycles of length 3 or 5 are \((3, 1)\)-colorable
- The list chromatic index of simple graphs whose odd cycles intersect in at most one edge
- List-edge-coloring of planar graphs without 6-cycles with three chords
- Computational aspects of greedy partitioning of graphs
- Colouring of (P₃ P₂)-free graphs
- Star coloring of certain graph classes
- Computing the list chromatic index of graphs
- Characterization of forbidden subgraphs for bounded star chromatic number
- Decomposition of cubic graphs related to Wegner's conjecture
- Acyclic colorings of locally planar graphs
- List total colorings of series-parallel graphs
- Equitable coloring of some convex polytope graphs
- Graph colouring and variations
- Deciding \(k\)-colorability in expected polynomial time
- Surfaces, tree-width, clique-minors, and partitions
- A new bound on the cyclic chromatic number
- Decomposing a planar graph into an independent set and a 3-degenerate graph
- Patch colorings and rigid colorings of the rational \(n\)-space
- On acyclic colorings of graphs on surfaces
- The structure of plane graphs with independent crossings and its applications to coloring problems
- Planar graphs without 4- and 5-cycles are acyclically 4-choosable
- Uncolorable mixed hypergraphs
- On the number of edges in hypergraphs critical with respect to strong colourings
- Homomorphism bounds and edge-colourings of \(K_{4}\)-minor-free graphs
- A structure of 1-planar graph and its applications to coloring problems
- Combinatorial Nullstellensatz and DP-coloring of graphs
- List edge coloring of outer-1-planar graphs
- Cyclic deficiency of graphs
- A sufficient condition for planar graphs with maximum degree 6 to be totally 8-colorable
- Structure and colour in triangle-free graphs
- Injective coloring of Halin graphs
- On \(t\)-relaxed 2-distant circular coloring of graphs
- Borodin-Kostochka's conjecture on \((P_5,C_4)\)-free graphs
- A game theoretic framework for software diversity for network security
- Counting critical subgraphs in \(k\)-critical graphs
- Nowhere-zero 3-flows in toroidal graphs
- The Alon-Tarsi number of \(K_5\)-minor-free graphs
- Total coloring of recursive maximal planar graphs
- Odd Hadwiger for line-graphs
- Partitioning planar graphs without 4-cycles and 6-cycles into a linear forest and a forest
- Asymptotic equivalence of Hadwiger's conjecture and its odd minor-variant
- A new upper bound on the chromatic number of graphs with no odd \(K_t\) minor
- Zero-divisor graphs and total coloring conjecture
- On indicated coloring of lexicographic product of graphs
- Graph coloring and semidefinite rank
- Colouring generalized claw-free graphs and graphs of large girth: bounding the diameter
- Graph \(r\)-hued colorings -- a survey
- Critical graphs for the chromatic edge-stability number
- Every planar graph without triangles adjacent to cycles of length 3 or 6 is \(( 1 , 1 , 1 )\)-colorable
- An enhanced formulation for solving graph coloring problems with the Douglas-Rachford algorithm
- An exact algorithm for the edge coloring by total labeling problem
- Construction of Barnette graphs whose large subgraphs are non-Hamiltonian
- On \(J\)-colorability of certain derived graph classes
- On some \(L(2, 1)\)-coloring parameters of certain graph classes
- Colouring \((P_r + P_s)\)-free graphs
- Bipartite induced density in triangle-free graphs
- New restrictions on defective coloring with applications to Steinberg-type graphs
- The list edge coloring and list total coloring of planar graphs with maximum degree at least 7
- \(S\)-packing chromatic vertex-critical graphs
- The Alon-Tarsi number of a planar graph minus a matching
- On the cyclic coloring conjecture
- List edge coloring of planar graphs without 6-cycles with two chords
- Maximum cuts in \(\mathscr{H} \)-free graphs
- Improper interval edge colorings of graphs
- Coloring temporal graphs
- Time complexity analysis of randomized search heuristics for the dynamic graph coloring problem
- Total-coloring of sparse graphs with maximum degree 6
- New potential functions for greedy independence and coloring
- Bipartite graphs whose squares are not chromatic-choosable
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4857375)
