scientific article; zbMATH DE number 3043302

Cited in

(only showing first 100 items - show all)

Cost minimization in wireless networks with a bounded and unbounded number of interfaces
A nonlinear lower bound on the practical combinational complexity
The subchromatic number of a graph
Equitable coloring of some convex polytope graphs
A different short proof of Brooks' theorem
Tough graphs and Hamiltonian circuits.
A note on coloring vertex-transitive graphs
Independent sets in \(\{\text{claw}, K_4 \}\)-free 4-regular graphs
The list version of the Borodin-Kostochka conjecture for graphs with large maximum degree
Tree-based unrooted nonbinary phylogenetic networks
Characterizing 4-critical graphs with Ore-degree at most seven
A generalization of König-Egervary graphs and heuristics for the maximum independent set problem with improved approximation ratios
Some upper bounds for the product of the domination number and the chromatic number of a graph
On the \(k\)-planar local crossing number
An immune algorithm with stochastic aging and Kullback entropy for the chromatic number problem
Regular independent sets
Planar graphs without 4-cycles adjacent to 3-cycles are list vertex 2-arborable
The \(m\)-degenerate chromatic number of a digraph
Chromatic properties of the Pancake graphs
On graphs with no induced subdivision of \(K_4\)
-list vertex coloring in linear time
A lower bound on the independence number of a graph in terms of degrees and local clique sizes
Graph polynomials and paintability of plane graphs
A proof of Tomescu's graph coloring conjecture
Vertex partition of hypergraphs and maximum degenerate subhypergraphs
A simple approximation algorithm for WIS based on the approximability in \(k\)-partite graphs
Partition into cliques for cubic graphs: Planar case, complexity and approximation
Are there any good digraph width measures?
Dirac's theorem on chordal graphs implies Brooks' theorem
Hard coloring problems in low degree planar bipartite graphs
4-edge-coloring graphs of maximum degree 3 in linear time
Kempe equivalence of colourings of cubic graphs
Independent sets of maximum weight in (\(p,q\))-colorable graphs.
Spectra of uniform hypergraphs
On the minimum number of arcs in \(k\)-dicritical oriented graphs
On the \(b\)-dominating coloring of graphs
Finite groups whose prime graphs are regular.
The complexity of changing colourings with bounded maximum degree
Extended Gallai's theorem
Hamiltonian degree conditions which imply a graph is pancyclic
On the number of touching pairs in a set of planar curves
On preserving full orientability of graphs
Colouring graphs when the number of colours is almost the maximum degree
Brooks' theorem in graph streams: a single-pass semi-streaming algorithm for \(\Delta\)-coloring
Distance-two colourings of Barnette graphs
Four coloring for a subset of maximal planar graphs with minimum degree five
The complexity of the Hajós calculus for planar graphs
Coloring signed graphs using DFS
Boundary properties of graphs for algorithmic graph problems
Eigenvalue bounds for the signless \(p\)-Laplacian
Independence in graphs with maximum degree four
A complete classification of the complexity of the vertex 3-colourability problem for quadruples of induced 5-vertex prohibitions
Graph folding and chromatic number
Coloring \(\{ P 2 \cup P 3 , \operatorname{house} \} \)-free graphs with \(\Delta - 1\) colors
Strengthening Brooks' chromatic bound on \(P_6\)-free graphs
A very simple algorithm for estimating the number of k‐colorings of a low‐degree graph
Inequalities between the domination number and the chromatic number of a graph
Efficient bounds for the stable set, vertex cover and set packing problems
Partition the vertices of a graph into one independent set and one acyclic set
Acyclically 3-colorable planar graphs
Relations between the lower domination parameters and the chromatic number of a graph.
Brooks' theorem for generalized dart graphs
Graphes cubiques d'indice trois, graphes cubiques isochromatiques, graphes cubiques d'indice quatre
Measurable versions of Vizing's theorem
scientific article; zbMATH DE number 7666240 (Why is no real title available?)
Weighted improper colouring
Equitable colorings of \(l\)-corona products of cubic graphs
Edge-coloring of 3-uniform hypergraphs
On the Ramsey numbers for stars versus complete graphs
Odd coloring of sparse graphs and planar graphs
Painting squares in \(\Delta^2-1\) shades
On \(r\)-dynamic coloring of graphs
Chromatic number of \(P_5\)-free graphs: Reed's conjecture
Upper transversals in hypergraphs
Simultaneous graph parameters: factor domination and factor total domination
A Catlin-type theorem for graph partitioning avoiding prescribed subgraphs
Highly irregular m-chromatic graphs
Digraphs and variable degeneracy
Star edge-coloring of graphs with maximum degree four
Independent sets in regular graphs
3-colorability and forbidden subgraphs. I: Characterizing pairs
A note on \(\Delta\)-critical graphs
Graph polynomials and group coloring of graphs
Borodin-Kostochka conjecture holds for \(\overline{K_{1 , 3}} \)-free graphs
Some generalizations of theorems on vertex coloring
Chromatic coloring with a maximum color class
Maximizing the number of independent sets of fixed size in connected graphs with given independence number
On critical subgraphs of colour-critical graphs
Coloring hammer-free graphs with \(\Delta - 1\) colors
Hadwiger number and chromatic number for near regular degree sequences
An improved upper bound on neighbor expanded sum distinguishing index
Large cliques in graphs with high chromatic number
Bounding \(\chi \) in terms of \(\omega \) and \(\varDelta \) for some classes of graphs
Remarks on dynamic monopolies with given average thresholds
On group chromatic number of graphs
On the chromatic number of integral circulant graphs
Cost Minimisation in Multi-interface Networks
Applications of edge coloring of multigraphs to vertex coloring of graphs
A bound on the chromatic number of a graph
Another bound on the chromatic number of a graph

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)