scientific article; zbMATH DE number 3043302
From MaRDI portal
Publication:5782525
zbMATH Open0027.26403MaRDI QIDQ5782525FDOQ5782525
Authors: R. Leonard Brooks 
Publication date: 1941
Title of this publication is not available (Why is that?)
Cited In (only showing first 100 items - show all)
- On the maximum spectral radius of multipartite graphs
- Domination versus independent domination in graphs of small regularity
- Flip graphs for infinite type surfaces
- Brooks-type theorem for \(r\)-hued coloring of graphs
- Two remarks on eventown and oddtown problems
- DP-degree colorable hypergraphs
- On three outer-independent domination related parameters in graphs
- Rainbow neighbourhood number of graphs
- Chromatic numbers of infinite graphs
- Improvement on Brooks' chromatic bound for a class of graphs
- Going wide with the 1-2-3 conjecture
- Multiple domination
- On the role of 3s for the 1-2-3 conjecture
- On a conjecture of Mohar concerning Kempe equivalence of regular graphs
- Equitable coloring of some convex polytope graphs
- The list version of the Borodin-Kostochka conjecture for graphs with large maximum degree
- Tree-based unrooted nonbinary phylogenetic networks
- On the \(k\)-planar local crossing number
- Chromatic properties of the Pancake graphs
- Kempe equivalence of colourings of cubic graphs
- A proof of Tomescu's graph coloring conjecture
- A simple approximation algorithm for WIS based on the approximability in \(k\)-partite graphs
- Graph polynomials and paintability of plane graphs
- Are there any good digraph width measures?
- 4-edge-coloring graphs of maximum degree 3 in linear time
- Extended Gallai's theorem
- A complete classification of the complexity of the vertex 3-colourability problem for quadruples of induced 5-vertex prohibitions
- On the number of touching pairs in a set of planar curves
- Distance-two colourings of Barnette graphs
- On preserving full orientability of graphs
- Title not available (Why is that?)
- Relations between the lower domination parameters and the chromatic number of a graph.
- Measurable versions of Vizing's theorem
- Odd coloring of sparse graphs and planar graphs
- Painting squares in \(\Delta^2-1\) shades
- Upper transversals in hypergraphs
- A Catlin-type theorem for graph partitioning avoiding prescribed subgraphs
- Highly irregular m-chromatic graphs
- Star edge-coloring of graphs with maximum degree four
- Graph polynomials and group coloring of graphs
- Large cliques in graphs with high chromatic number
- Maximizing the number of independent sets of fixed size in connected graphs with given independence number
- Some generalizations of theorems on vertex coloring
- Cost Minimisation in Multi-interface Networks
- Applications of edge coloring of multigraphs to vertex coloring of graphs
- ``Global graph problems tend to be intractable
- A Brooks type theorem for the maximum local edge connectivity
- Rainbow graph splitting
- 2-distance vertex-distinguishing index of subcubic graphs
- A local epsilon version of Reed's conjecture
- A short proof of Brooks’ Theorem for vertex arboricity
- Maximum independent sets near the upper bound
- Colouring problems
- Title not available (Why is that?)
- Every graph \(G\) is Hall \(\Delta(G)\)-extendible
- Hadwiger's conjecture for 3-arc graphs
- Stable routing scheduling algorithms in multi-hop wireless networks
- Point partition numbers: decomposable and indecomposable critical graphs
- On 3-colouring of graphs with short faces and bounded maximum vertex degree
- Chromatic numbers of layered graphs with a bounded maximal clique
- Partitioning a graph into degenerate subgraphs
- Generalized hypergraph coloring
- Introduction to reconfiguration
- Relative Cayley graphs of finite groups
- Title not available (Why is that?)
- The complexity of the vertex 3-colorability problem for some hereditary classes defined by 5-vertex forbidden induced subgraphs
- Fractionally total colouring \(G_{n,p}\)
- APX-hardness and approximation for the \(k\)-burning number problem
- Domination parameters of a graph and its complement
- Zig-zag facial total-coloring of plane graphs
- Approximation algorithms for vertex happiness
- A hypocoloring model for batch scheduling
- Tough graphs and Hamiltonian circuits. (Reprint)
- Title not available (Why is that?)
- Energy consumption minimization in ad hoc wireless and multi-interface networks
- Maximum weight edge-constrained matchings
- Some Topics in Graph Theory
- Bilu-Linial stability, certified algorithms and the independent set problem
- \(H\)-coloring degree-bounded (acyclic) digraphs
- A comparison of bounds for the chromatic number of a graph
- Bounds on the dynamic chromatic number of a graph in terms of its chromatic number
- Minimum fill-in: inapproximability and almost tight lower bounds
- Variable neighborhood search for extremal graphs. 22. Extending bounds for independence to upper irredundance
- The chromatic number of 5-valent circulants
- Extension problems with degree bounds
- LARGE SIGNED SUBSET SUMS
- A geometric multigrid preconditioning strategy for DPG system matrices
- On percolation and \(\mathcal{NP}\)-hardness
- Upper bounds for the chromatic number of a graph
- Relating the independence number and the dissociation number
- Symmetric set coloring of signed graphs
- Borodin-Kostochka's conjecture on \((P_5,C_4)\)-free graphs
- On Tuza's conjecture for triangulations and graphs with small treewidth
- Generalized DP-colorings of graphs
- The proper vertex-disconnection of graphs
- Note on 4-coloring 6-regular triangulations on the torus
- Optimizing concurrency under Scheduling by Edge Reversal
- Exact and superpolynomial approximation algorithms for the \textsc{densest \textit{K}-subgraph} problem
- Partitions of hypergraphs under variable degeneracy constraints
- On list critical 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)
