scientific article; zbMATH DE number 3043302

zbMATH Open0027.26403MaRDI QIDQ5782525FDOQ5782525

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)

The subchromatic number of a graph
Tough graphs and Hamiltonian circuits.
A note on coloring vertex-transitive graphs
Large Independent Sets in Triangle-Free Planar 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
An improved upper bound on neighbor expanded sum distinguishing index
Bounding $\chi $ in terms of $\omega $ and $\varDelta $ for some classes of graphs
A bound on the chromatic number of a graph
Another bound on the chromatic number of a graph
The chromatic number of a signed graph
The complexity of some graph colouring problems
The independence number of graphs in terms of degrees
Grundy number and products of graphs
On the NP-completeness of the $k$-colorability problem for triangle-free graphs
On the fractional dimension of partially ordered sets
Optimal three-dimensional orthogonal graph drawing in the general position model.
On bipartization of cubic graphs by removal of an independent set
Some simplified NP-complete graph problems
Domination and total domination in cubic graphs of large girth
Differential approximation algorithms for some combinatorial optimization problems
Ore's conjecture on color-critical graphs is almost true
Randomly colouring graphs (a combinatorial view)
Some results on Reed's conjecture about $\omega ,\Delta $, and $\chi $ with respect to $\alpha $
On graphs whose least eigenvalue exceeds $-1-\sqrt2$
Complexity of determining the most vital elements for the $p$-median and $p$-center location problems
Equitable $\Delta$-coloring of graphs
The $(p,q)$-total labeling problem for trees
The complexity of the 3-colorability problem in the absence of a pair of small forbidden induced subgraphs
Spanning trees with pairwise nonadjacent endvertices
On $k$-domination and $j$-independence in graphs
A greedy algorithm for the social golfer and the Oberwolfach problem
Coloring of pseudocubic graphs in three colors
Brooks' theorem via the Alon-Tarsi theorem
Domination in graphs of minimum degree at least two and large girth
Conditional colorings of graphs
On the Independence Number of Graphs with Maximum Degree 3
On the total coloring of certain graphs
Graphs with chromatic number close to maximum degree
A new Turán-type theorem for cliques in graphs
Inverting the Turán problem with chromatic number
A new lower bound on the number of edges in colour-critical graphs and hypergraphs
An upper bound for the chromatic number of line graphs
New potential functions for greedy independence and coloring
Coloring graphs with sparse neighborhoods
Coloring (P5,gem) $({P}_{5},\text{gem})$‐free graphs with Δ−1 ${\rm{\Delta }}-1$ colors
Some Ramsey-Type Numbers and the Independence Ratio
On equitable coloring of bipartite graphs
A note on relaxed equitable coloring of graphs
Plongements lipschitziens dans ${\bbfR}\sp n$
Finding independent sets in $K_4$-free 4-regular connected graphs
Combinatorics. Abstracts from the workshop held January 1--7, 2023
$[r,s,t]$-colorings of graphs
$[r,s,t]$-chromatic numbers and hereditary properties of graphs
$[r,s,t]$-coloring of trees and bipartite graphs
Approximation algorithm for maximum edge coloring
Hardness of approximation of the discrete time-cost tradeoff problem
Covering the cliques of a graph with vertices
The complexity of the proper orientation number
Improved lower bounds on the number of edges in list critical and online list critical graphs
Variable neighborhood search for extremal graphs. 21. Conjectures and results about the independence number
On the number of nonisomorphic orientable regular embeddings of complete graphs
On approximation properties of the Independent set problem for degree 3 graphs
Cost minimization in wireless networks with a bounded and unbounded number of interfaces
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
On the Complexity of the Vertex 3-Coloring Problem for the Hereditary Graph Classes With Forbidden Subgraphs of Small Size
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

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)