Graph partitions under average degree constraint
From MaRDI portal
Publication:6187347
DOI10.1016/j.jctb.2023.11.006zbMath1530.05156arXiv2202.08123OpenAlexW4389339887MaRDI QIDQ6187347
Publication date: 15 January 2024
Published in: Journal of Combinatorial Theory. Series B (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/2202.08123
Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Graph minors (05C83) Vertex degrees (05C07)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- On 1-improper 2-coloring of sparse graphs
- Improper coloring of sparse graphs with a given girth. I: \((0,1)\)-colorings of triangle-free graphs
- Efficient algorithms for decomposing graphs under degree constraints
- On an upper bound of the graph's chromatic number, depending on the graph's degree and density
- Extremal results on defective colorings of graphs
- Algorithmic approach to the satisfactory graph partitioning problem
- Defective 2-colorings of planar graphs without 4-cycles and 5-cycles
- Defective coloring on classes of perfect graphs
- Partitions of multigraphs under minimum degree constraints
- On partitions of \(K_{2, 3}\)-free graphs under degree constraints
- Partitions of graphs and multigraphs under degree constraints
- New restrictions on defective coloring with applications to Steinberg-type graphs
- Asymptotic density of graphs excluding disconnected minors
- Asymptotically almost every \(2r\)-regular graph has an internal partition
- On partitions of graphs under degree constraints
- The extremal function for disconnected minors
- Defective 2-colorings of sparse graphs
- On a conjecture of Schweser and Stiebitz
- On connected partition with degree constraints
- Improper Coloring of Sparse Graphs with a Given Girth, II: Constructions
- Internal Partitions of Regular Graphs
- Improper coloring of unit disk graphs
- Defective coloring revisited
- The number of defective colorings of graphs on surfaces
- Graph decomposition with constraints on the connectivity and minimum degree
- Defective colorings of graphs in surfaces: Partitions into subgraphs of bounded valency
- A note on defective colorings of graphs in surfaces
- On decomposition of triangle-free graphs under degree constraints
- Characterization of Cycle Obstruction Sets for Improper Coloring Planar Graphs
- Problems and results on judicious partitions
- Decomposing graphs with girth at least five under degree constraints
- Parameterized (Approximate) Defective Coloring
- Note on improper coloring of $1$-planar graphs
- Decomposing Weighted Graphs
- Decomposing C4‐free graphs under degree constraints
- Improper coloring of graphs on surfaces
