scientific article; zbMATH DE number 3043302

Cited in

(only showing first 100 items - show all)

Optimal Packet-Oblivious Stable Routing in Multi-hop Wireless Networks
On degree sums of a triangle-free graph
On group chromatic number of graphs
The colour theorems of Brooks and Gallai extended
A property tester for tree-likeness of quartet topologies
Coloring a graph with \(\Delta-1\) colors: conjectures equivalent to the Borodin-Kostochka conjecture that appear weaker
A unified proof of Brooks' theorem and Catlin's theorem
Simultaneous graph parameters: factor domination and factor total domination
Bounded vertex colorings of graphs
Distributed coloring algorithms for triangle-free graphs
Graphes cubiques d'indice trois, graphes cubiques isochromatiques, graphes cubiques d'indice quatre
On the complexity of the vertex 3-coloring problem for the hereditary graph classes with forbidden subgraphs of small size
Bounding \(\chi\) by a fraction of \(\Delta\) for graphs without large cliques
Weighted improper colouring
Covering the vertex set of a graph with subgraphs of smaller degree
Partitioning sparse graphs into an independent set and a forest of bounded degree
On a Lovász-type lemma, applied to Brooks' theorem for list-colouring
An immune algorithm with stochastic aging and Kullback entropy for the chromatic number problem
Brooks' theorem for generalized dart graphs
A short proof of Catlin's extension of Brooks' theorem
A note on \(\Delta\)-critical graphs
Linear time self-stabilizing colorings
Spectral radii of graphs with given chromatic number
Excess in critical graphs
Chromatic optimisation: Limitations, objectives, uses, references
A nonlinear lower bound on the practical combinational complexity
Colour-critical graphs with few edges
A nonlinear lower bound on the practical combinational complexity
A new approach to constructing exponentially many nonisomorphic nonorientable triangular embeddings of complete graphs
Recursive coloration of countable graphs
Graph coloring, minimum-diameter partitioning, and the analysis of confusion matrices
On the choice number of complete multipartite graphs with part size four
The choice number versus the chromatic number for graphs embeddable on orientable surfaces
Hard coloring problems in low degree planar bipartite graphs
On the chromatic number of integral circulant graphs
Characterizing 4-critical graphs with Ore-degree at most seven
A matroid analogue of a theorem of Brooks for graphs
Inequalities between the domination number and the chromatic number of a graph
Some upper bounds for the product of the domination number and the chromatic number of a graph
On constructive methods in the theory of colour-critical graphs
Hadwiger number and chromatic number for near regular degree sequences
Edge density and independence ratio in triangle-free graphs with maximum degree three
Algorithmic complexity of list colorings
The complexity of the Hajós calculus for planar graphs
scientific article; zbMATH DE number 3339166 (Why is no real title available?)
A graph colouring model for assigning a heterogeneous workforce to a given schedule
Bounds on eigenvalues and chromatic numbers
An extension of Brooks' theorem to n-degenerate graphs
A different short proof of Brooks' theorem
On decision and optimization (\(k\),\(l\))-graph sandwich problems
A strengthening of Brooks' theorem
Degree bounds for linear discrepancy of interval orders and disconnected posets
Independent sets of maximum weight in (\(p,q\))-colorable graphs.
Turán Graphs, Stability Number, and Fibonacci Index
List homomorphisms of graphs with bounded degrees
On the Ramsey numbers for stars versus complete graphs
The symbiotic relationship of combinatorics and matrix theory
Supersaturation problem for color-critical graphs
An introduction to the discharging method via graph coloring
Distributed colorings for collision-free routing in sink-centric sensor networks
Dynamic proper colorings of a graph
Degree choosable signed graphs
Upper bounds on the chromatic number of triangle-free graphs with a forbidden subtree
Eigenvalue bounds for the signless \(p\)-Laplacian
Small embeddings of partial directed triple systems and partial triple systems with even \(\lambda\)
Recursive families of graphs
The complexity of the empire colouring problem
On critical subgraphs of colour-critical graphs
Remarks on dynamic monopolies with given average thresholds
\(\Delta \)-list vertex coloring in linear time
A new Turán-type theorem for cliques in graphs
Inverting the Turán problem with chromatic number
Cost minimization in wireless networks with a bounded and unbounded number of interfaces
Conditional colorings of graphs
Covering the cliques of a graph with vertices
A new lower bound on the number of edges in colour-critical graphs and hypergraphs
On the Independence Number of Graphs with Maximum Degree 3
Spectra of uniform hypergraphs
On approximation properties of the Independent set problem for degree 3 graphs
\([r,s,t]\)-colorings of graphs
Acyclically 3-colorable planar graphs
Combinatorics. Abstracts from the workshop held January 1--7, 2023
Coloring signed graphs using DFS
Coloring of pseudocubic graphs in three colors
\([r,s,t]\)-chromatic numbers and hereditary properties of graphs
Ore's conjecture on color-critical graphs is almost true
Randomly colouring graphs (a combinatorial view)
A lower bound on the independence number of a graph in terms of degrees and local clique sizes
3-colorability and forbidden subgraphs. I: Characterizing pairs
Boundary properties of graphs for algorithmic graph problems
The subchromatic number of a graph
Planar graphs without 4-cycles adjacent to 3-cycles are list vertex 2-arborable
Spanning trees with pairwise nonadjacent endvertices
Grundy number and products of graphs
Independence in graphs with maximum degree four
On \(r\)-dynamic coloring of graphs
Bounding \(\chi \) in terms of \(\omega \) and \(\varDelta \) for some classes of graphs
Chromatic number of \(P_5\)-free graphs: Reed's conjecture
Some results on Reed's conjecture about \(\omega ,\Delta \), and \(\chi \) with respect to \(\alpha \)
On the NP-completeness of the \(k\)-colorability problem for triangle-free 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)