Algebraic Graph Theory: COLOURING PROBLEMS

By N. Biggs. 1974

How researchers see this paper

The researchers whose trusted networks rank it highest, strongest advocate first. Every researcher gets a different order.

Citations in the corpus

Learning World Graphs to Accelerate Hierarchical Reinforcement Learning (2019, neutral): “ received by the agent are in the form of bird-eye view matrix representations. More details on preprocessing are available in the 3 World Graph Discovery We envision a simple directed weighted graph [11] G wto capture the high-level structure of the world. Its nodes are a set of points of interest,”
Spectra of Large Random Trees (2009, background): “where Nk(t) is the number of matchings of t that contain k edges (see, for example, Additional Result 7b of [Big93]), and the result follows immediately.”
Stabilisation of infinitesimally rigid formations of multi-robot networks (2009, background): “Furthermore, the Laplacian and incidence matrices are related by ^ L ¼ ^ H T ^ H (Biggs 1974, Proposition 4.8).”
The characteristic polynomial of the Laplacian of graphs in (a,b)-linear classes (2002, background): “A comprehensive treatment of spectral graph theory is given in [1–4].”
Spectra of random graphs with given expected degrees (2003, methodology): “The combinatorial Laplacian D−A with D denoting the diagonal degree matrix is a major tool for enumerating spanning trees and has numerous applications [6, 21].”
The Phoenix Project: master constraint programme for loop quantum gravity (2003, background): “ properties and fewer edges of γtraversed. Notice that the notion of a minimal loop does not refer to a background metric and is obviously covariant. Actually it is a notion of algebraic graph theory [50] since it does not refer to any knotting (embedding). Thus, it might be possible to make the qua”