Proper conflict-free coloring of graphs with large maximum degree
From MaRDI portal
Publication:6654118
DOI10.1137/23M1563281MaRDI QIDQ6654118FDOQ6654118
Daniel W. Cranston, Chun-Hung Liu
Publication date: 18 December 2024
Published in: SIAM Journal on Discrete Mathematics (Search for Journal in Brave)
Extremal problems in graph theory (05C35) Vertex degrees (05C07) Coloring of graphs and hypergraphs (05C15)
Cites Work
- Title not available (Why is that?)
- Acyclic coloring of graphs
- Star coloring of graphs
- Acyclic edge-coloring using entropy compression
- Conflict-Free Colorings of Simple Geometric Regions with Applications to Frequency Assignment in Cellular Networks
- Colouring a graph frugally
- Linear coloring of graphs
- Conflict-Free Colourings of Graphs and Hypergraphs
- Linear colorings of subcubic graphs
- Real zeros and partitions without singleton blocks
- Conflict-free colourings of uniform hypergraphs with few edges
- Another approach to non-repetitive colorings of graphs of bounded degree
- Proper conflict-free and unique-maximum colorings of planar graphs with respect to neighborhoods
- Remarks on proper conflict-free colorings of graphs
- A General Framework for Hypergraph Coloring
- Proper conflict-free list-coloring, odd minors, subdivisions, and layered treewidth
- Proper conflict-free coloring of sparse graphs
Cited In (1)
This page was built for publication: Proper conflict-free coloring of graphs with large maximum degree
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6654118)
