Brooks type results for conflict-free colorings and \(\{a, b \}\)-factors in graphs
From MaRDI portal
Publication:2515567
DOI10.1016/j.disc.2015.05.020zbMath1318.05024arXiv1410.1219OpenAlexW2216812014MaRDI QIDQ2515567
Jonathan Rollin, Maria A. Axenovich
Publication date: 5 August 2015
Published in: Discrete Mathematics (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1410.1219
Hypergraphs (05C65) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Coloring of graphs and hypergraphs (05C15)
Related Items
Regular colorings in regular graphs, A result on fractional \((a,b,k)\)-critical covered graphs, Degree conditions for fractional \((a,b,k)\)-critical covered graphs
Cites Work
- Unnamed Item
- Zero-sum magic labelings and null sets of regular graphs
- Factors and factorizations of graphs. Proof techniques in factor theory
- Graph unique-maximum and conflict-free colorings
- \(\{k,r-k\}\)-factors of \(r\)-regular graphs
- On an edge ranking problem of trees and graphs
- The colour theorems of Brooks and Gallai extended
- Conflict-free coloring of points and simple regions in the plane
- Unique-Maximum and Conflict-Free Coloring for Hypergraphs and Tree Graphs
- Conflict-Free Colourings of Uniform Hypergraphs With Few Edges
- On The Chromatic Number of Geometric Hypergraphs
- Conflict-Free Colourings of Graphs and Hypergraphs
- Rankings of Graphs
- Conflict-Free Colorings of Simple Geometric Regions with Applications to Frequency Assignment in Cellular Networks
- Note on parity factors of regular graphs
- Conflict-Free Coloring and its Applications
- On the Existence of General Factors in Regular Graphs
- Conflict-Free Colouring of Graphs
- Optimal edge ranking of trees in linear time
