Fractional domatic number and minimum degree
Fuente:
arXiv
Saved in:
| Main Authors: | Chuet, Quentin, Demaret, Hugo, La, Hoang, Pirot, François |
|---|---|
| Format: | Preprint |
| Published: |
2025
|
| Subjects: | |
| Online Access: | |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Similar Items
Acyclic colourings of graphs with obstructions
by: Chuet, Quentin, et al.
Published: (2022)
by: Chuet, Quentin, et al.
Published: (2022)
New bounds for proper $h$-conflict-free colourings
by: Chuet, Quentin, et al.
Published: (2025)
by: Chuet, Quentin, et al.
Published: (2025)
Fractional coloring with local demands and applications to degree-sequence bounds on the independence number
by: Kelly, Tom, et al.
Published: (2018)
by: Kelly, Tom, et al.
Published: (2018)
Chromatic discrepancy of locally $s$-colourable graphs
by: Corsini, Timothée, et al.
Published: (2025)
by: Corsini, Timothée, et al.
Published: (2025)
Weak coloring numbers of minor-closed graph classes
by: Hodor, Jędrzej, et al.
Published: (2024)
by: Hodor, Jędrzej, et al.
Published: (2024)
Centered colorings and weak coloring numbers in minor-closed graph classes
by: Hodor, Jędrzej, et al.
Published: (2026)
by: Hodor, Jędrzej, et al.
Published: (2026)
On the minimum number of arcs in $4$-dicritical oriented graphs
by: Havet, Frédéric, et al.
Published: (2023)
by: Havet, Frédéric, et al.
Published: (2023)
Minimum acyclic number and maximum dichromatic number of oriented triangle-free graphs of a given order
by: Aboulker, Pierre, et al.
Published: (2024)
by: Aboulker, Pierre, et al.
Published: (2024)
Upper bounds on minimum size of feedback arc set of directed multigraphs with bounded degree
by: Gutin, Gregory, et al.
Published: (2024)
by: Gutin, Gregory, et al.
Published: (2024)
On the minimum number of inversions to make a digraph $k$-(arc-)strong
by: Duron, Julien, et al.
Published: (2023)
by: Duron, Julien, et al.
Published: (2023)
Counting the minimum number of arcs in an oriented graph having weak diameter 2
by: Das, Sandip, et al.
Published: (2023)
by: Das, Sandip, et al.
Published: (2023)
2-distance 4-coloring of planar subcubic graphs with girth at least 21
by: La, Hoang, et al.
Published: (2021)
by: La, Hoang, et al.
Published: (2021)
Immersions of large cliques in graphs with independence number 2 and bounded maximum degree
by: Botler, Fábio, et al.
Published: (2025)
by: Botler, Fábio, et al.
Published: (2025)
Graph Reconstruction with Connectivity Queries
by: Kluk, Kacper, et al.
Published: (2024)
by: Kluk, Kacper, et al.
Published: (2024)
On minimum Venn diagrams
by: Brenner, Sofia, et al.
Published: (2025)
by: Brenner, Sofia, et al.
Published: (2025)
Cube Height, Cube Width and Related Extremal Problems for Posets
by: Bastide, Paul, et al.
Published: (2025)
by: Bastide, Paul, et al.
Published: (2025)
Quickly excluding an apex-forest
by: Hodor, Jędrzej, et al.
Published: (2024)
by: Hodor, Jędrzej, et al.
Published: (2024)
Centered colorings in minor-closed graph classes
by: Hodor, Jędrzej, et al.
Published: (2024)
by: Hodor, Jędrzej, et al.
Published: (2024)
M-convexity of the minimum-cost packings of arborescences
by: Takazawa, Kenjiro
Published: (2018)
by: Takazawa, Kenjiro
Published: (2018)
Network fault costs based on minimum leaf spanning trees
by: Goedgebeur, Jan, et al.
Published: (2025)
by: Goedgebeur, Jan, et al.
Published: (2025)
Extremal chemical graphs of maximum degree at most 3 for 33 degree-based topological indices
by: Bonte, Sébastien, et al.
Published: (2025)
by: Bonte, Sébastien, et al.
Published: (2025)
Elimination distance to bounded degree on planar graphs
by: Lindermayr, Alexander, et al.
Published: (2020)
by: Lindermayr, Alexander, et al.
Published: (2020)
ChemicHull: an online tool for determining extremal chemical graphs of maximum degree at most 3 for any degree-based topological indices
by: Bonte, Sébastien, et al.
Published: (2025)
by: Bonte, Sébastien, et al.
Published: (2025)
On Realizing Reconfiguration Graphs of Cliques
by: Hoang, Duc A.
Published: (2026)
by: Hoang, Duc A.
Published: (2026)
Tree decompositions with small width, spread, order and degree
by: Wood, David R.
Published: (2025)
by: Wood, David R.
Published: (2025)
Coboundary and cosystolic expansion without dependence on dimension or degree
by: Dikstein, Yotam, et al.
Published: (2023)
by: Dikstein, Yotam, et al.
Published: (2023)
Fractional coloring via entropy
by: Dhawan, Abhishek
Published: (2026)
by: Dhawan, Abhishek
Published: (2026)
On expectations and variances in the hard-core model on bounded degree graphs
by: Davies, Ewan, et al.
Published: (2025)
by: Davies, Ewan, et al.
Published: (2025)
Blow-up structure of graphs excluding a tree or an apex-tree as a minor
by: Claus, Quentin, et al.
Published: (2026)
by: Claus, Quentin, et al.
Published: (2026)
Complete polyhedral description of chemical graphs of maximum degree at most 3
by: Dusollier, Valentin, et al.
Published: (2025)
by: Dusollier, Valentin, et al.
Published: (2025)
Generalizations of Ferber-Krivelevich and Gallai Theorems on parity of degrees in induced subgraphs
by: Ai, Jiangdong, et al.
Published: (2025)
by: Ai, Jiangdong, et al.
Published: (2025)
Sensitivity of $m$-ary functions and low degree partitions of Hamming graphs
by: Asensio, Sara, et al.
Published: (2024)
by: Asensio, Sara, et al.
Published: (2024)
Partitions of planar (oriented) graphs into a connected acyclic and an independent set
by: Cambie, Stijn, et al.
Published: (2024)
by: Cambie, Stijn, et al.
Published: (2024)
EPPA numbers of graphs
by: Bradley-Williams, David, et al.
Published: (2023)
by: Bradley-Williams, David, et al.
Published: (2023)
Trees with maximum $σ$-irregularity under a prescribed maximum degree 6
by: Bašić, Milan
Published: (2026)
by: Bašić, Milan
Published: (2026)
The classification of Boolean degree $1$ functions in high-dimensional finite vector spaces
by: Ihringer, Ferdinand
Published: (2023)
by: Ihringer, Ferdinand
Published: (2023)
Largest planar graphs of diameter $3$ and fixed maximum degree -- connection with fractional matchings
by: Dailly, Antoine, et al.
Published: (2025)
by: Dailly, Antoine, et al.
Published: (2025)
Cop numbers of periodic graphs
by: De Carufel, Jean-Lou, et al.
Published: (2023)
by: De Carufel, Jean-Lou, et al.
Published: (2023)
C sequential optimization numbers
by: Hui, Zile
Published: (2024)
by: Hui, Zile
Published: (2024)
Computing the clique number of tournaments
by: Aubian, Guillaume
Published: (2024)
by: Aubian, Guillaume
Published: (2024)
Similar Items
-
Acyclic colourings of graphs with obstructions
by: Chuet, Quentin, et al.
Published: (2022) -
New bounds for proper $h$-conflict-free colourings
by: Chuet, Quentin, et al.
Published: (2025) -
Fractional coloring with local demands and applications to degree-sequence bounds on the independence number
by: Kelly, Tom, et al.
Published: (2018) -
Chromatic discrepancy of locally $s$-colourable graphs
by: Corsini, Timothée, et al.
Published: (2025) -
Weak coloring numbers of minor-closed graph classes
by: Hodor, Jędrzej, et al.
Published: (2024)