Majority edge-colorings of graphs
From MaRDI portal
Publication:2692181
DOI10.37236/11291OpenAlexW4323660191MaRDI QIDQ2692181
Dieter Rautenbach, Rafał Kalinowski, Mariusz Woźniak, Johannes Pardey, Felix Bock, Monika Pilśniak
Publication date: 21 March 2023
Published in: The Electronic Journal of Combinatorics (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/2205.11125
Extremal problems in graph theory (05C35) Coloring of graphs and hypergraphs (05C15) Vertex degrees (05C07)
Cites Work
- Unnamed Item
- Unnamed Item
- Unfriendly partitions of a graph
- Matching theory
- Bounded degree acyclic decompositions of digraphs.
- Vizing's and Shannon's theorems for defective edge colouring
- Majority choosability of digraphs
- Majority colourings of digraphs
- Aspects of edge list-colourings
- Graph colouring and the probabilistic method