scientific article; zbMATH DE number 3043302

Cited in

(only showing first 100 items - show all)

Approximation algorithm for maximum edge coloring
Linear time self-stabilizing colorings
Extension problems with degree bounds
Precoloring extension for 2-connected graphs with maximum degree three
On list critical graphs
Efficient bounds for the stable set, vertex cover and set packing problems
Graph homomorphisms into the five-cycle
Highly irregular m-chromatic graphs
Inequalities between the domination number and the chromatic number of a graph
Applications of edge coloring of multigraphs to vertex coloring of graphs
On constructive methods in the theory of colour-critical graphs
A comparison of bounds for the chromatic number of a graph
Chromatic optimisation: Limitations, objectives, uses, references
Improvement on Brooks' chromatic bound for a class of graphs
The symbiotic relationship of combinatorics and matrix theory
The complexity of some graph colouring problems
Covering the cliques of a graph with vertices
Chromatic numbers of infinite graphs
Excess in critical graphs
Some simplified NP-complete graph problems
An extension of Brooks' theorem to n-degenerate graphs
On graphs whose least eigenvalue exceeds -1-2
Covering the vertex set of a graph with subgraphs of smaller degree
A bound on the chromatic number of a graph
A short proof of Catlin's extension of Brooks' theorem
Another bound on the chromatic number of a graph
Colouring problems
A graph colouring model for assigning a heterogeneous workforce to a given schedule
Differential approximation algorithms for some combinatorial optimization problems
A generalization of König-Egervary graphs and heuristics for the maximum independent set problem with improved approximation ratios
A strengthening of Brooks' theorem
The independence number of graphs in terms of degrees
Algorithmic complexity of list colorings
On the fractional dimension of partially ordered sets
The colour theorems of Brooks and Gallai extended
On the NP-completeness of the \(k\)-colorability problem for triangle-free graphs
Spanning trees with pairwise nonadjacent endvertices
Bounds on eigenvalues and chromatic numbers
Finding independent sets in \(K_4\)-free 4-regular connected graphs
A new lower bound on the number of edges in colour-critical graphs and hypergraphs
Relations between the lower domination parameters and the chromatic number of a graph.
3-colorability and forbidden subgraphs. I: Characterizing pairs
Coloring graphs with sparse neighborhoods
Colour-critical graphs with few edges
4-edge-coloring graphs of maximum degree 3 in linear time
Hardness of approximation of the discrete time-cost tradeoff problem
Bounds on the dynamic chromatic number of a graph in terms of its chromatic number
A geometric multigrid preconditioning strategy for DPG system matrices
Exact and superpolynomial approximation algorithms for the \textsc{densest \textit{K}-subgraph} problem
Maximizing the number of independent sets of fixed size in connected graphs with given independence number
Scheduling of unit-length jobs with cubic incompatibility graphs on three uniform machines
Domination parameters of a graph and its complement
On the number of touching pairs in a set of planar curves
On a conjecture of Mohar concerning Kempe equivalence of regular graphs
On the \(k\)-planar local crossing number
Partitioning sparse graphs into an independent set and a forest of bounded degree
A Brooks type theorem for the maximum local edge connectivity
Eigenvalue bounds for the signless \(p\)-Laplacian
A hypocoloring model for batch scheduling
Graph coloring, minimum-diameter partitioning, and the analysis of confusion matrices
Equitable coloring of some convex polytope graphs
``Global graph problems tend to be intractable
The subchromatic number of a graph
A new Turán-type theorem for cliques in graphs
Graphes cubiques d'indice trois, graphes cubiques isochromatiques, graphes cubiques d'indice quatre
On the number of nonisomorphic orientable regular embeddings of complete graphs
Independent sets of maximum weight in (\(p,q\))-colorable graphs.
Optimal three-dimensional orthogonal graph drawing in the general position model.
On decision and optimization (\(k\),\(l\))-graph sandwich problems
On equitable coloring of bipartite graphs
Edge density and independence ratio in triangle-free graphs with maximum degree three
Weighted improper colouring
A note on relaxed equitable coloring of graphs
Complexity of determining the most vital elements for the p-median and p-center location problems
Tree-based unrooted nonbinary phylogenetic networks
Measurable versions of Vizing's theorem
Star edge-coloring of graphs with maximum degree four
Partitioning a graph into degenerate subgraphs
Maximum independent sets near the upper bound
On 3-colouring of graphs with short faces and bounded maximum vertex degree
Inverting the Turán problem with chromatic number
Borodin-Kostochka's conjecture on \((P_5,C_4)\)-free graphs
On \(r\)-hued list coloring of \(K_4 ( 7 )\)-minor free graphs
The choice number versus the chromatic number for graphs embeddable on orientable surfaces
Graph polynomials and group coloring of graphs
Stable routing scheduling algorithms in multi-hop wireless networks
Point partition numbers: decomposable and indecomposable critical graphs
A Catlin-type theorem for graph partitioning avoiding prescribed subgraphs
Going wide with the 1-2-3 conjecture
Bounding \(\chi\) by a fraction of \(\Delta\) for graphs without large cliques
Graph \(r\)-hued colorings -- a survey
Domination versus independent domination in graphs of small regularity
Generalized hypergraph coloring
Distance-two colourings of Barnette graphs
On the role of 3s for the 1-2-3 conjecture
New potential functions for greedy independence and coloring
Chromatic numbers of layered graphs with a bounded maximal clique
Dynamic proper colorings of a graph
Remarks on dynamic monopolies with given average thresholds
The complexity of the Hajós calculus for planar graphs

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 Q5782525)