scientific article; zbMATH DE number 3043302

zbMATH Open0027.26403MaRDI QIDQ5782525FDOQ5782525

Authors: R. Leonard Brooks 

Publication date: 1941

Title of this publication is not available (Why is that?)

zbMATH Keywords

Topology

Cited In (only showing first 100 items - show all)

• A different short proof of Brooks' theorem
• An immune algorithm with stochastic aging and Kullback entropy for the chromatic number problem
• Characterizing 4-critical graphs with Ore-degree at most seven
• Some upper bounds for the product of the domination number and the chromatic number of a graph
• \(\Delta \)-list vertex coloring in linear time
• Hard coloring problems in low degree planar bipartite graphs
• Independent sets of maximum weight in (\(p,q\))-colorable graphs.
• The complexity of the Hajós calculus for planar graphs
• Eigenvalue bounds for the signless \(p\)-Laplacian
• Inequalities between the domination number and the chromatic number of a graph
• Graphes cubiques d'indice trois, graphes cubiques isochromatiques, graphes cubiques d'indice quatre
• Weighted improper colouring
• Brooks' theorem for generalized dart graphs
• On the Ramsey numbers for stars versus complete graphs
• Simultaneous graph parameters: factor domination and factor total domination
• A note on \(\Delta\)-critical graphs
• Hadwiger number and chromatic number for near regular degree sequences
• On critical subgraphs of colour-critical graphs
• Remarks on dynamic monopolies with given average thresholds
• On group chromatic number of graphs
• On the chromatic number of integral circulant graphs
• On decision and optimization (\(k\),\(l\))-graph sandwich problems
• On a Lovász-type lemma, applied to Brooks' theorem for list-colouring
• A matroid analogue of a theorem of Brooks for graphs
• The symbiotic relationship of combinatorics and matrix theory
• Distributed colorings for collision-free routing in sink-centric sensor networks
• On degree sums of a triangle-free graph
• 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
• Linear time self-stabilizing colorings
• The choice number versus the chromatic number for graphs embeddable on orientable surfaces
• A graph colouring model for assigning a heterogeneous workforce to a given schedule
• 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
• Chromatic optimisation: Limitations, objectives, uses, references
• List homomorphisms of graphs with bounded degrees
• The complexity of the empire colouring problem
• On constructive methods in the theory of colour-critical graphs
• Covering the vertex set of a graph with subgraphs of smaller degree
• Degree bounds for linear discrepancy of interval orders and disconnected posets
• Excess in critical graphs
• Title not available (Why is that?)
• A short proof of Catlin's extension of Brooks' theorem
• A strengthening of Brooks' theorem
• The colour theorems of Brooks and Gallai extended
• A property tester for tree-likeness of quartet topologies
• Colour-critical graphs with few edges
• On the choice number of complete multipartite graphs with part size four
• Edge density and independence ratio in triangle-free graphs with maximum degree three
• Turán Graphs, Stability Number, and Fibonacci Index
• Bounded vertex colorings of graphs
• A new approach to constructing exponentially many nonisomorphic nonorientable triangular embeddings of complete graphs
• Recursive coloration of countable graphs
• Algorithmic complexity of list colorings
• Recursive families of graphs
• Small embeddings of partial directed triple systems and partial triple systems with even \(\lambda\)
• Distributed coloring algorithms for triangle-free graphs
• Supersaturation problem for color-critical graphs
• An introduction to the discharging method via graph coloring
• Dynamic proper colorings of a graph
• Degree choosable signed graphs
• Upper bounds on the chromatic number of triangle-free graphs with a forbidden subtree
• Spectral radii of graphs with given chromatic number
• An extension of Brooks' theorem to n-degenerate graphs
• Partitioning sparse graphs into an independent set and a forest of bounded degree
• Optimal Packet-Oblivious Stable Routing in Multi-hop Wireless Networks
• A nonlinear lower bound on the practical combinational complexity
• A nonlinear lower bound on the practical combinational complexity
• Graph coloring, minimum-diameter partitioning, and the analysis of confusion matrices
• Bounds on eigenvalues and chromatic numbers
• The subchromatic number of a graph
• Tough graphs and Hamiltonian circuits.
• A note on coloring vertex-transitive graphs
• Planar graphs without 4-cycles adjacent to 3-cycles are list vertex 2-arborable
• A generalization of König-Egervary graphs and heuristics for the maximum independent set problem with improved approximation ratios
• Independent sets in \(\{\text{claw}, K_4 \}\)-free 4-regular graphs
• Regular independent sets
• The \(m\)-degenerate chromatic number of a digraph
• On graphs with no induced subdivision of \(K_4\)
• A lower bound on the independence number of a graph in terms of degrees and local clique sizes
• Partition into cliques for cubic graphs: Planar case, complexity and approximation
• On the \(b\)-dominating coloring of graphs
• Spectra of uniform hypergraphs
• Finite groups whose prime graphs are regular.
• The complexity of changing colourings with bounded maximum degree
• Hamiltonian degree conditions which imply a graph is pancyclic
• A very simple algorithm for estimating the number of k‐colorings of a low‐degree graph
• Colouring graphs when the number of colours is almost the maximum degree
• Coloring signed graphs using DFS
• Boundary properties of graphs for algorithmic graph problems
• Independence in graphs with maximum degree four
• Partition the vertices of a graph into one independent set and one acyclic set
• Efficient bounds for the stable set, vertex cover and set packing problems
• Acyclically 3-colorable planar graphs
• Edge-coloring of 3-uniform hypergraphs
• On \(r\)-dynamic coloring of graphs
• Chromatic number of \(P_5\)-free graphs: Reed's conjecture
• Independent sets in regular graphs
• 3-colorability and forbidden subgraphs. I: Characterizing pairs
• Chromatic coloring with a maximum color class

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)