On coloring numbers of graph powers
From MaRDI portal
Publication:2174571
DOI10.1016/j.disc.2019.111712zbMath1437.05074arXiv1907.10962OpenAlexW2962829512MaRDI QIDQ2174571
Junjun Yi, Daqing Yang, Henry A. Kierstead
Publication date: 21 April 2020
Published in: Discrete Mathematics (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1907.10962
coloring numbersquare of graphsgraph powermaximum average degreeharmonious strategyweak coloring number
Related Items (1)
Cites Work
- Coloring games on squares of graphs
- Sparsity. Graphs, structures, and algorithms
- List coloring the square of sparse graphs with large degree
- Coloring the square of graphs whose maximum average degree is less than 4
- Generalization of transitive fraternal augmentations for directed graphs and its applications
- Colouring graphs with bounded generalized colouring number
- A simple competitive graph coloring algorithm
- Chromatic numbers of exact distance graphs
- Orderings on graphs and game coloring number
- Constant-factor approximation of the domination number in sparse graphs
- Coloring squares of graphs with mad constraints
- Uniform orderings for generalized coloring numbers
- Graphs with linearly bounded Ramsey numbers
- Grad and classes with bounded expansion. I: Decompositions
- Coloring squares of planar graphs with girth six
- Very asymmetric marking games
- On the degrees of the vertices of a directed graph
- Radius two trees specify χ‐bounded classes
- Coloring Powers of Planar Graphs
- Coloring and Covering Nowhere Dense Graphs
- Improper colourings inspired by Hadwiger's conjecture
- Deciding First-Order Properties of Nowhere Dense Graphs
- Coloring Powers of Chordal Graphs
- Decomposition of Finite Graphs Into Forests
- On the generalised colouring numbers of graphs that exclude a fixed minor
- Competitive colorings of oriented graphs
This page was built for publication: On coloring numbers of graph powers
