Randomly colouring graphs (a combinatorial view)
From MaRDI portal
(Redirected from Publication:458462)
Recommendations
- Colouring random graphs
- scientific article; zbMATH DE number 4101221
- scientific article; zbMATH DE number 4134071
- scientific article; zbMATH DE number 1984543
- Randomly coloring random graphs
- Coloring random graphs
- Coloring random graphs
- Coloring random graphs
- Colouring Random Regular Graphs
- Randomly colorable graphs in greedy coloring
Cites work
- scientific article; zbMATH DE number 981678 (Why is no real title available?)
- scientific article; zbMATH DE number 446476 (Why is no real title available?)
- scientific article; zbMATH DE number 4177085 (Why is no real title available?)
- scientific article; zbMATH DE number 4170917 (Why is no real title available?)
- scientific article; zbMATH DE number 5764785 (Why is no real title available?)
- scientific article; zbMATH DE number 5764899 (Why is no real title available?)
- scientific article; zbMATH DE number 3980105 (Why is no real title available?)
- scientific article; zbMATH DE number 4049676 (Why is no real title available?)
- scientific article; zbMATH DE number 1189240 (Why is no real title available?)
- scientific article; zbMATH DE number 3675940 (Why is no real title available?)
- scientific article; zbMATH DE number 3704754 (Why is no real title available?)
- scientific article; zbMATH DE number 3735847 (Why is no real title available?)
- scientific article; zbMATH DE number 3753004 (Why is no real title available?)
- scientific article; zbMATH DE number 52938 (Why is no real title available?)
- scientific article; zbMATH DE number 194009 (Why is no real title available?)
- scientific article; zbMATH DE number 3458807 (Why is no real title available?)
- scientific article; zbMATH DE number 3492718 (Why is no real title available?)
- scientific article; zbMATH DE number 3515489 (Why is no real title available?)
- scientific article; zbMATH DE number 3571502 (Why is no real title available?)
- scientific article; zbMATH DE number 3590114 (Why is no real title available?)
- scientific article; zbMATH DE number 3621721 (Why is no real title available?)
- scientific article; zbMATH DE number 1246230 (Why is no real title available?)
- scientific article; zbMATH DE number 1286500 (Why is no real title available?)
- scientific article; zbMATH DE number 1303525 (Why is no real title available?)
- scientific article; zbMATH DE number 1318047 (Why is no real title available?)
- scientific article; zbMATH DE number 1131873 (Why is no real title available?)
- scientific article; zbMATH DE number 1496580 (Why is no real title available?)
- scientific article; zbMATH DE number 1523257 (Why is no real title available?)
- scientific article; zbMATH DE number 1540669 (Why is no real title available?)
- scientific article; zbMATH DE number 1775440 (Why is no real title available?)
- scientific article; zbMATH DE number 1789917 (Why is no real title available?)
- scientific article; zbMATH DE number 3801730 (Why is no real title available?)
- scientific article; zbMATH DE number 1857648 (Why is no real title available?)
- scientific article; zbMATH DE number 780788 (Why is no real title available?)
- scientific article; zbMATH DE number 782056 (Why is no real title available?)
- scientific article; zbMATH DE number 3238447 (Why is no real title available?)
- scientific article; zbMATH DE number 3273761 (Why is no real title available?)
- scientific article; zbMATH DE number 3284071 (Why is no real title available?)
- scientific article; zbMATH DE number 3405977 (Why is no real title available?)
- scientific article; zbMATH DE number 4187830 (Why is no real title available?)
- scientific article; zbMATH DE number 3043302 (Why is no real title available?)
- scientific article; zbMATH DE number 3050594 (Why is no real title available?)
- scientific article; zbMATH DE number 3102313 (Why is no real title available?)
- 25 pretty graph colouring problems
- A Contribution to the Theory of Chromatic Polynomials
- A Measure of Asymptotic Efficiency for Tests of a Hypothesis Based on the sum of Observations
- A Note On Reed's Conjecture
- A Simplified Form for Nearly Reducible and Nearly Decomposable Matrices
- A Theorem about the Channel Assignment Problem
- A bound on the chromatic number of a graph
- A bound on the strong chromatic index of a graph
- A bound on the total chromatic number
- A new lower bound on the number of perfect matchings in cubic graphs
- A new proof of the independence ratio of triangle-free cubic graphs
- A short proof of Minc's conjecture
- A short proof of the existence of highly chromatic hypergraphs without short cycles
- A still better performance guarantee for approximate graph coloring
- A survey on labeling graphs with a condition at distance two
- Acyclic coloring of graphs
- Acyclic colorings of planar graphs
- Acyclic edge colorings of graphs
- An Improvement of Hind's Upper Bound on the Total Chromatic Number
- An algorithmic approach to the Lovász local lemma. I
- An entropy approach to the hard-core model on bipartite graphs
- An entropy proof of Bregman's theorem
- An upper bound for the chromatic number of line graphs
- An upper bound for the total chromatic number
- Applications of product colouring
- Asymptotic behavior of the chromatic index for hypergraphs
- Asymptotically good list-colorings
- Asymptotics of the chromatic index for multigraphs
- Boolean functions whose Fourier transform is concentrated on the first two levels.
- Boolean functions with low average sensitivity depend on few coordinates
- Bounding χ in terms of ω and Δ for quasi-line graphs
- Bounds for the Real Number Graph Labellings and Application to Labellings of the Triangular Lattice
- Brick decompositions and the matching rank of graphs
- Chromatic number, girth and maximal degree
- Circular choosability of graphs
- Circular chromatic number: A survey
- Color-critical graphs on a fixed surface
- Coloring graphs with sparse neighborhoods
- Coloring nearly-disjoint hypergraphs with \(n + o(n)\) colors
- Coloring quasi-line graphs
- Coloring the square of a planar graph
- Colouring graphs when the number of colours is nearly the maximum degree
- Concentration for Independent Permutations
- Concentration of measure and isoperimetric inequalities in product spaces
- Concerning a Conjecture of Marshall Hall
- Counting 1-factors in regular bipartite graphs
- Covering the vertex set of a graph with subgraphs of smaller degree
- Edge density and independence ratio in triangle-free graphs with maximum degree three
- Entropy, independent sets and antichains: A new approach to Dedekind's problem
- Every planar map is four colorable. I: Discharging
- Every planar map is four colorable. II: Reducibility
- Fourier analysis and large independent sets in powers of complete graphs
- Free Bits, PCPs, and Nonapproximability---Towards Tight Results
- Graph Theory and Probability
- Graph labellings with variable weights, a survey
- Graph products, Fourier analysis and spectral techniques
- Hyperbolic polynomials approach to van der Waerden/Schrijver-Valiant like conjectures, sharper bounds, simpler proofs and algorithmic applications
- Hypergraphs, entropy, and inequalities
- Improved bounds on acyclic edge colouring
- Independent sets in graph powers are almost contained in juntas
- Induced matchings in bipartite graphs
- Inequalities in Fourier analysis
- Labeling planar graphs with a condition at distance two
- Labelings of Graphs with Fixed and Variable Edge-Weights
- Labelling Graphs with a Condition at Distance 2
- List Colouring Squares of Planar Graphs
- List colouring when the chromatic number is close to the order of the graph
- List edge and list total colourings of multigraphs
- Lower bounds on the competitive ratio for mobile user tracking and distributed job scheduling
- Matching theory
- Multilevel Distance Labelings for Paths and Cycles
- Near perfect coverings in graphs and hypergraphs
- Near-optimal list colorings
- Nonrepetitive colorings of graphs
- On Brooks' Theorem for Sparse Graphs
- On Lower Bounds for Permanents of (0, 1) Matrices
- On Moore Graphs with Diameters 2 and 3
- On Total Chromatic Number of a Graph
- On a packing and covering problem
- On an upper bound of the graph's chromatic number, depending on the graph's degree and density
- On chromatic number of finite set-systems
- On colorings of graphs without short cycles
- On the Permanent of a Certain Class of (0, 1)-Matrices
- On the Shannon capacity of a graph
- On the \(L(p,1)\)-labelling of graphs
- On the total coloring of certain graphs
- On the total coloring of planar graphs.
- On total 9-coloring planar graphs of maximum degree seven
- On total colourings of graphs
- On two questions about circular choosability
- Paths and Circuits in Critical Graphs
- Paths, Trees, and Flowers
- Perfect graphs and graph entropy: An updated survey
- Perfect matchings in planar cubic graphs
- Planar graphs of maximum degree seven are Class I
- Probability and random processes.
- Proof of the van der Waerden conjecture regarding the permanent of a doubly stochastic matrix
- Random graphs.
- Rank of maximum matchings in a graph
- Relating path coverings to vertex labellings with a condition at distance two
- Size and independence in triangle‐free graphs with maximum degree three
- Some Ramsey-Type Numbers and the Independence Ratio
- Some intersection theorems for ordered sets and graphs
- Some remarks on the theory of graphs
- Source coding and graph entropies
- Star chromatic number
- Subgraphs with a large cochromatic number
- Sur le coloriage des graphs
- The $L(2,1)$-Labeling Problem on Graphs
- The Channel Assignment Problem with Variable Weights
- The Chromatic Number of Graph Powers
- The Complexity of Near-Optimal Graph Coloring
- The NP-Completeness of Edge-Coloring
- The Theory of Information and Coding
- The acyclic edge chromatic number of a random d‐regular graph is d + 1
- The four-colour theorem
- The fractional chromatic number of graphs of maximum degree at most three
- The probabilistic method. With an appendix on the life and work of Paul Erdős.
- The solution of van der Waerden's problem for permanents
- The total chromatic number of any multigraph with maximum degree five is at most seven
- Total Coloring With $\Delta + \mbox\lowercasepoly(\log \Delta)$ Colors
- Total Colourings of Graphs
- Total chromatic number of planar graphs with maximum degree ten
- Total colorings of planar graphs with large maximum degree
- Upper bounds for permanents of $\left( {0,\,1} \right)$-matrices
- Zero knowledge and the chromatic number
- Étude des coefficients de Fourier des fonctions de \(L^ p(G)\)
Cited in
(16)- Colouring Random Regular Graphs
- Randomly coloring random graphs
- scientific article; zbMATH DE number 3861163 (Why is no real title available?)
- scientific article; zbMATH DE number 1984543 (Why is no real title available?)
- Finding Pseudorandom Colorings of Pseudorandom Graphs
- Combinatorial optimization in system configuration design
- Graph and hypergraph colouring via nibble methods: a survey
- Probabilistic arguments in graph coloring (invited talk)
- Randomized Δ-edge colouring via exchanges of complex colours
- scientific article; zbMATH DE number 3989350 (Why is no real title available?)
- An introduction to the discharging method via graph coloring
- Graph colouring and the probabilistic method
- Coloring random graphs
- Coloring random graphs
- Colouring Random 4-Regular Graphs
- Random coloring evolution on graphs
This page was built for publication: Randomly colouring graphs (a combinatorial view)
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q458462)
