On the Chromatic Number of Subgraphs of a Given Graph
From MaRDI portal
Publication:4194980
DOI10.2307/2041460zbMath0408.05025OpenAlexW4231793127MaRDI QIDQ4194980
Publication date: 1977
Published in: Proceedings of the American Mathematical Society (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.2307/2041460
Related Items (14)
\(C_4\)-free subgraphs with large average degree ⋮ Subgraphs of Kneser graphs with large girth and large chromatic number ⋮ Triangle-free subgraphs with large fractional chromatic number ⋮ Combinatorics. Abstracts from the workshop held January 1--7, 2023 ⋮ Combinatorics, probability and computing. Abstracts from the workshop held April 24--30, 2022 ⋮ Graphs of large chromatic number ⋮ Triangle-free subgraphs with large fractional chromatic number ⋮ A note on Thomassen's conjecture ⋮ On forbidden subdivision characterizations of graph classes ⋮ A polynomial Turing-kernel for weighted independent set in bull-free graphs ⋮ On a conjecture of Thomassen concerning subgraphs of large girth ⋮ Extremal triangle-free and odd-cycle-free colourings of uncountable graphs ⋮ From \(\chi\)- to \(\chi_p\)-bounded classes ⋮ A counterexample to a conjecture about triangle-free induced subgraphs of graphs with large chromatic number
This page was built for publication: On the Chromatic Number of Subgraphs of a Given Graph
