scientific article; zbMATH DE number 1286500
From MaRDI portal
Publication:4242948
DOI10.1002/(SICI)1097-0118(199804)27:4%3C177::AID-JGT1%3E3.0.CO;2-KzbMATH Open0980.05026MaRDI QIDQ4242948FDOQ4242948
Authors: Bruce Reed 
Publication date: 4 March 2002
Title of this publication is not available (Why is that?)
Recommendations
- Bounding \(\chi\) by a fraction of \(\Delta\) for graphs without large cliques
- On bounding the difference of the maximum degree and the clique number
- A short proof that \(\chi\) can be bounded \(\epsilon\) away from \(\Delta + 1\) toward \(\omega\)
- Bounding \(\chi \) in terms of \(\omega \) and \(\varDelta \) for some classes of graphs
- Coloring Graphs with Dense Neighborhoods
Cited In (71)
- On Graph Associations
- A note on coloring vertex-transitive graphs
- New upper bounds for the chromatic number of a graph
- A lower bound on the independence number of a graph in terms of degrees and local clique sizes
- Hitting all maximum cliques with a stable set using lopsided independent transversals
- Colouring graphs when the number of colours is almost the maximum degree
- Clique number of the square of a line graph
- Short fans and the 5/6 bound for line graphs
- Title not available (Why is that?)
- Chromatic number of \(P_5\)-free graphs: Reed's conjecture
- A note on \(\Delta\)-critical graphs
- Algorithmic bounds for the chromatic number†
- Large cliques in graphs with high chromatic number
- Maximizing line subgraphs of diameter at most \(t\)
- Bounding \(\chi \) in terms of \(\omega \) and \(\varDelta \) for some classes of graphs
- On the Nash number and the diminishing Grundy number of a graph
- \(t\)-strong cliques and the degree-diameter problem
- A local epsilon version of Reed's conjecture
- Randomly colouring graphs (a combinatorial view)
- Some results on Reed's conjecture about \(\omega ,\Delta \), and \(\chi \) with respect to \(\alpha \)
- The Fractional Chromatic Number of \(\boldsymbol{K_{\Delta }}\)-Free Graphs
- A note on hitting maximum and maximal cliques with a stable set
- On the proper orientation number of bipartite graphs
- Strong cliques in claw-free graphs
- Title not available (Why is that?)
- Coloring Graphs with Dense Neighborhoods
- Bounding \(\chi\) by a fraction of \(\Delta\) for graphs without large cliques
- List-coloring claw-free graphs with small clique number
- Star coloring of certain graph classes
- The chromatic number of triangle-free and broom-free graphs in terms of the number of vertices
- Upper bounds for the chromatic number of a graph
- Homogeneous sets, clique-separators, critical graphs, and optimal \(\chi\)-binding functions
- Chromatic number and complete graph substructures for degree sequences
- An upper bound for the chromatic number of line graphs
- Coloring nonuniform hypergraphs: A new algorithmic approach to the general Lov�sz local lemma
- A strengthening of Brooks' theorem
- A superlocal version of Reed's conjecture
- Exact square coloring of subcubic planar graphs
- Graphs with least eigenvalue \(-2\): ten years on
- Colouring graphs with sparse neighbourhoods: bounds and applications
- On the list coloring version of Reed's conjecture
- New potential functions for greedy independence and coloring
- (\(\Delta-k\))-critical graphs
- Coloring (P5,gem) $({P}_{5},\text{gem})$‐free graphs with Δ−1 ${\rm{\Delta }}-1$ colors
- Square-Free Graphs with No Six-Vertex Induced Path
- Title not available (Why is that?)
- Claw-free graphs, skeletal graphs, and a stronger conjecture on \(\omega\), \(\Delta\), and \(\chi\)
- A short proof that \(\chi\) can be bounded \(\epsilon\) away from \(\Delta + 1\) toward \(\omega\)
- On bounding the difference of the maximum degree and the clique number
- Combinatorics. Abstracts from the workshop held January 1--7, 2023
- Asymptotically optimal frugal colouring
- A Ramsey‐type problem and the Turán numbers*
- \([r,s,t]\)-coloring of trees and bipartite graphs
- Coloring graphs with no induced five‐vertex path or gem
- Upper bounds on the chromatic number of triangle-free graphs with a forbidden subtree
- New construction of graphs with high chromatic number and small clique number
- Vertex cover problem parameterized above and below tight bounds
- Brooks' Theorem and Beyond
- Graph coloring approach with new upper bounds for the chromatic number: team building application
- Brooks' theorem in graph streams: a single-pass semi-streaming algorithm for \(\Delta\)-coloring
- Title not available (Why is that?)
- Title not available (Why is that?)
- Fractional coloring with local demands and applications to degree-sequence bounds on the independence number
- \(t\)-strong cliques and the degree-diameter problem
- A quick way to verify if a graph is 3-colorable
- Superfast coloring in CONGEST via efficient color sampling
- Superfast coloring in CONGEST via efficient color sampling
- Graph and hypergraph colouring via nibble methods: a survey
- A note on Reed's conjecture for triangle-free graphs
- Title not available (Why is that?)
- Solution to a problem of Erdős on the chromatic index of hypergraphs with bounded codegree
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 Q4242948)
