An asymptotic bound for the strong chromatic number

DOI10.1017/S0963548318000561zbMath1436.05040arXiv1711.08214OpenAlexW2769693038MaRDI QIDQ5222554

Allan Lo, Nicolás Sanhueza-Matamala

Publication date: 6 April 2020

Published in: Combinatorics, Probability and Computing (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1711.08214

zbMATH Keywords

strongly \(r\)-colourable graph

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Coloring of graphs and hypergraphs (05C15)

Related Items (3)

On sufficient conditions for spanning structures in dense graphs ⋮ Strong coloring 2‐regular graphs: Cycle restrictions and partial colorings ⋮ Powers of Hamiltonian cycles in multipartite graphs

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• The linear arboricity of graphs
• A solution to a colouring problem of P. Erdős
• Fractional v. integral covers in hypergraphs of bounded edge size
• A condition for matchability in hypergraphs
• Independent systems of representatives in weighted graphs
• Co-degree density of hypergraphs
• A Note on Vertex List Colouring
• Independent transversals and hypergraph matchings - an elementary approach
• A Dirac-Type Theorem for 3-Uniform Hypergraphs
• An improved bound for the strong chromatic number
• The strong chromatic number of a graph
• Triangle Factors in Random Graphs
• On the Strong Chromatic Number
• Transversals of Vertex Partitions in Graphs
• A Multipartite Version of the Hajnal–Szemerédi Theorem for Graphs and Hypergraphs
• On the Strong Chromatic Number of Graphs

This page was built for publication: An asymptotic bound for the strong chromatic number