scientific article; zbMATH DE number 1286500
From MaRDI portal
Publication:4242948
DOI<177::AID-JGT1>3.0.CO;2-K 10.1002/(SICI)1097-0118(199804)27:4<177::AID-JGT1>3.0.CO;2-KzbMath0980.05026MaRDI QIDQ4242948
Publication date: 4 March 2002
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Related Items
Clique number of the square of a line graph ⋮ Chromatic number of \(P_5\)-free graphs: Reed's conjecture ⋮ On the Nash number and the diminishing Grundy number of a graph ⋮ Colouring graphs with sparse neighbourhoods: bounds and applications ⋮ A lower bound on the independence number of a graph in terms of degrees and local clique sizes ⋮ A Ramsey‐type problem and the Turán numbers* ⋮ Brooks' Theorem and Beyond ⋮ A Short Proof That χ Can be Bounded ε Away from Δ + 1 toward ω ⋮ Maximizing Line Subgraphs of Diameter at Most t ⋮ Homogeneous sets, clique-separators, critical graphs, and optimal \(\chi\)-binding functions ⋮ Exact square coloring of subcubic planar graphs ⋮ Bounding \(\chi\) by a fraction of \(\Delta\) for graphs without large cliques ⋮ A Note on Hitting Maximum and Maximal Cliques With a Stable Set ⋮ The chromatic number of triangle-free and broom-free graphs in terms of the number of vertices ⋮ Coloring (P5,gem) $({P}_{5},\text{gem})$‐free graphs with Δ−1 ${\rm{\Delta }}-1$ colors ⋮ Combinatorics. Abstracts from the workshop held January 1--7, 2023 ⋮ A note on \(\Delta\)-critical graphs ⋮ A note on Reed's conjecture for triangle-free graphs ⋮ The Fractional Chromatic Number of \(\boldsymbol{K_{\Delta }}\)-Free Graphs ⋮ Graph and hypergraph colouring via nibble methods: a survey ⋮ On the list coloring version of Reed's conjecture ⋮ Large cliques in graphs with high chromatic number ⋮ Coloring graphs with no induced five‐vertex path or gem ⋮ Short Fans and the 5/6 Bound for Line Graphs ⋮ Vertex cover problem parameterized above and below tight bounds ⋮ New construction of graphs with high chromatic number and small clique number ⋮ Star coloring of certain graph classes ⋮ Graph coloring approach with new upper bounds for the chromatic number: team building application ⋮ Unnamed Item ⋮ Randomly colouring graphs (a combinatorial view) ⋮ Colouring graphs when the number of colours is almost the maximum degree ⋮ On the proper orientation number of bipartite graphs ⋮ Chromatic number and complete graph substructures for degree sequences ⋮ A superlocal version of Reed's conjecture ⋮ Graphs with least eigenvalue \(-2\): ten years on ⋮ An upper bound for the chromatic number of line graphs ⋮ On bounding the difference of the maximum degree and the clique number ⋮ Unnamed Item ⋮ Corrigendum to: ``A local epsilon version of Reed's conjecture ⋮ Upper bounds on the chromatic number of triangle-free graphs with a forbidden subtree ⋮ \([r,s,t\)-coloring of trees and bipartite graphs] ⋮ New potential functions for greedy independence and coloring ⋮ Asymptotically optimal frugal colouring ⋮ Bounding \(\chi \) in terms of \(\omega \) and \(\varDelta \) for some classes of graphs ⋮ Some results on Reed's conjecture about \(\omega ,\Delta \), and \(\chi \) with respect to \(\alpha \) ⋮ (\(\Delta-k\))-critical graphs ⋮ [https://portal.mardi4nfdi.de/wiki/Publication:4521547 Coloring nonuniform hypergraphs: A new algorithmic approach to the general Lov�sz local lemma] ⋮ Unnamed Item ⋮ A local epsilon version of Reed's conjecture ⋮ Hitting all maximum cliques with a stable set using lopsided independent transversals ⋮ Algorithmic bounds for the chromatic number† ⋮ Superfast coloring in CONGEST via efficient color sampling ⋮ List-coloring claw-free graphs with small clique number ⋮ Superfast coloring in CONGEST via efficient color sampling ⋮ Strong cliques in claw-free graphs ⋮ Claw‐Free Graphs, Skeletal Graphs, and a Stronger Conjecture on ω, Δ, and χ ⋮ Square-Free Graphs with No Six-Vertex Induced Path ⋮ Coloring Graphs with Dense Neighborhoods ⋮ A strengthening of Brooks' theorem ⋮ A note on coloring vertex-transitive graphs ⋮ Upper bounds for the chromatic number of a graph ⋮ $t$-Strong Cliques and the Degree-Diameter Problem
