Image de couverture de livre

On strongly and robustly critical graphs

Fuente: arXiv

Enregistré dans:

Détails bibliographiques
Auteurs principaux:	Bernshteyn, Anton, Kaul, Hemanshu, Mudrock, Jeffrey A., Sharma, Gunjan
Format:	Preprint
Publié:	2024
Sujets:	Combinatorics
Accès en ligne:	Acceder al recurso
Tags:	Ajouter un tag Pas de tags, Soyez le premier à ajouter un tag!

Documents similaires

On the DP-chromatic Number of Cartesian Products of Critical Graphs
par: Kaul, Hemanshu, et autres
Publié: (2025)

Shameful Inequalities for List and DP Coloring of Graphs
par: Kaul, Hemanshu, et autres
Publié: (2024)

On Strongly and Robustly Critical Graphs
par: Anton Bernshteyn, et autres
Publié: (2026)

DP-Coloring of Graphs from Random Covers
par: Bernshteyn, Anton, et autres
Publié: (2023)

Counting Packings of List-colorings of Graphs
par: Kaul, Hemanshu, et autres
Publié: (2024)

Counting List Colorings of Unlabeled Graphs
par: Kaul, Hemanshu, et autres
Publié: (2024)

List Coloring the Cartesian Product of a Complete Graph and Complete Bipartite Graph
par: Kaul, Hemanshu, et autres
Publié: (2025)

A Note on Fractional DP-Coloring of Graphs
par: Dominik, Daniel, et autres
Publié: (2019)

Flexible list colorings: Maximizing the number of requests satisfied
par: Kaul, Hemanshu, et autres
Publié: (2022)

A Polynomial Method for Counting Colorings of Sparse Graphs
par: Dahlberg, Samantha L., et autres
Publié: (2023)

Borel line graphs
par: Anderson, James, et autres
Publié: (2023)

On Polynomial Representations of the DP Color Function: Theta Graphs and Their Generalizations
par: Halberg, Charlie, et autres
Publié: (2020)

Embedding Borel graphs into grids of asymptotically optimal dimension
par: Bernshteyn, Anton, et autres
Publié: (2024)

Large-scale geometry of Borel graphs of polynomial growth
par: Bernshteyn, Anton, et autres
Publié: (2023)

Coloring graphs with forbidden almost bipartite subgraphs
par: Anderson, James, et autres
Publié: (2022)

Borel versions of the Local Lemma and LOCAL algorithms for graphs of finite asymptotic separation index
par: Bernshteyn, Anton, et autres
Publié: (2023)

Fast algorithms for Vizing's theorem on bounded degree graphs
par: Bernshteyn, Anton, et autres
Publié: (2023)

Borel Local Lemma: arbitrary random variables and limited exponential growth
par: Bernshteyn, Anton, et autres
Publié: (2024)

A linear-time algorithm for $(1+ε)Δ$-edge-coloring
par: Bernshteyn, Anton, et autres
Publié: (2024)

Borel Vizing's Theorem for Graphs of Subexponential Growth
par: Bernshteyn, Anton, et autres
Publié: (2023)

Weak Degeneracy of Planar Graphs
par: Bernshteyn, Anton, et autres
Publié: (2024)

On Polynomial Representations of Dual DP Color Functions
par: Mudrock, Jeffrey A., et autres
Publié: (2024)

Enumerative Chromatic Choosability
par: Allred, Sarah, et autres
Publié: (2025)

Fractional Strict Degeneracy of Graphs
par: Dominik, Daniel, et autres
Publié: (2026)

A Spectral Turán Problem for a Fixed Tree
par: Desai, Dheer Noal, et autres
Publié: (2025)

Flexible list colorings: Maximizing the number of requests satisfied
par: Hemanshu Kaul, et autres
Publié: (2024)

Separating complexity classes of LCL problems on grids
par: Berlow, Katalin, et autres
Publié: (2025)

On universal graphs for trees and treewidth $k$ graphs
par: Kaul, Neel, et autres
Publié: (2025)

Sunflowers in set systems with small VC-dimension
par: Balogh, József, et autres
Publié: (2024)

Note on robust coloring of planar graphs
par: Kardoš, František, et autres
Publié: (2024)

On strong odd colorings of graphs
par: Caro, Yair, et autres
Publié: (2024)

Flow-critical graphs
par: Árnadóttir, Arnbjörg Soffía, et autres
Publié: (2025)

On the Ohba Number and Generalized Ohba Numbers of Complete Bipartite Graphs
par: Cano, Kennedy, et autres
Publié: (2024)

Hoffman colorability of (strongly) regular graphs
par: Abiad, Aida, et autres
Publié: (2025)

Connectivity of contraction-critical graphs
par: Lafferty, Michael, et autres
Publié: (2025)

Extremal graphs for disjoint union of vertex-critical graphs
par: Zhang, Wenqian
Publié: (2025)

Size conditions and spectral conditions for generalized factor-critical (bicritical) graphs and $k$-$d$-critical graphs
par: Zhang, Zhenhao, et autres
Publié: (2026)

On strong nodal domains for eigenfunctions of Hamming graphs
par: Valyuzhenich, Alexandr, et autres
Publié: (2025)

The strong chromatic index of 1-planar graphs
par: Wang, Yiqiao, et autres
Publié: (2022)

Orientations of graphs omitting non-edge-critical directed graphs
par: Sheats, Hannah
Publié: (2025)