Cover Image

Strong odd colorings in graph classes of bounded expansion

Fuente: arXiv

Saved in:

Bibliographic Details
Main Author:	Pilipczuk, Michał
Format:	Preprint
Published:	2025
Subjects:	Combinatorics Discrete Mathematics
Online Access:	Acceder al recurso
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

On graphs coverable by chubby shortest paths
by: Hatzel, Meike, et al.
Published: (2025)

A polynomial bound on the number of minimal separators and potential maximal cliques in $P_6$-free graphs of bounded clique number
by: Pilipczuk, Marcin, et al.
Published: (2023)

Erdős-Pósa property of tripods in directed graphs
by: Briański, Marcin, et al.
Published: (2024)

First-order transducibility among classes of sparse graphs
by: Gajarský, Jakub, et al.
Published: (2025)

Graph classes through the lens of logic
by: Pilipczuk, Michał
Published: (2025)

Obstructions and dualities for matroid depth parameters
by: Gajarský, Jakub, et al.
Published: (2025)

Centered colorings in minor-closed graph classes
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)

On coarse tree decompositions and coarse balanced separators
by: Abrishami, Tara, et al.
Published: (2025)

Upper bounds on the average number of colors in the non-equivalent colorings of a graph
by: Hertz, Alain, et al.
Published: (2021)

Weak coloring numbers of minor-closed graph classes
by: Hodor, Jędrzej, et al.
Published: (2024)

3D-grids are not transducible from planar graphs
by: Gajarský, Jakub, et al.
Published: (2025)

Cliquewidth and dimension
by: Joret, Gwenaël, et al.
Published: (2023)

Odd-Cycle-Packing-treewidth: On the Maximum Independent Set problem in odd-minor-free graph classes
by: Choi, Mujin, et al.
Published: (2025)

Tight bound on treedepth in terms of pathwidth and longest path
by: Hatzel, Meike, et al.
Published: (2023)

Tree decompositions whose trees are subgraphs: An application of Simon's factorization
by: Bourneuf, Romain, et al.
Published: (2026)

Coarse Balanced Separators in Fat-Minor-Free Graphs
by: Bonnet, Édouard, et al.
Published: (2026)

Half-integral Erdős-Pósa property for non-null $S$-$T$ paths
by: Chekan, Vera, et al.
Published: (2024)

Linear colorings of graphs
by: Hilaire, Claire, et al.
Published: (2025)

On the expansion of Hanoi graphs
by: Eppstein, David, et al.
Published: (2025)

On near optimal colorable graphs
by: Angeliya, C. U., et al.
Published: (2025)

Equitable coloring of sparse graphs
by: Liu, Weichan, et al.
Published: (2024)

The sandwich problem for odd-hole-free and even-hole-free graphs
by: Cameron, Kathie, et al.
Published: (2024)

Equitable coloring of large bipartite graphs
by: Nikabadi, Amir
Published: (2026)

Odd coloring graphs with linear neighborhood complexity
by: Davies, James, et al.
Published: (2025)

Fast algorithm for $S$-packing coloring of Halin graphs
by: Zhang, Xin, et al.
Published: (2025)

Independent sets and colorings of $K_{t,t,t}$-free graphs
by: Dhawan, Abhishek, et al.
Published: (2025)

Restricted subgraphs of edge-colored graphs and applications
by: Sudakov, Benny
Published: (2024)

On locating and neighbor-locating colorings of sparse graphs
by: Chakraborty, Dipayan, et al.
Published: (2023)

On the balanceability of some graph classes
by: Dailly, Antoine, et al.
Published: (2020)

Lower Bounds and properties for the average number of colors in the non-equivalent colorings of a graph
by: Hertz, Alain, et al.
Published: (2021)

List coloring ordered graphs with forbidden induced subgraphs
by: Piecyk, Marta, et al.
Published: (2025)

Winding number and circular 4-coloring of signed graphs
by: Gujgiczer, Anna, et al.
Published: (2023)

Filling some gaps on the edge coloring problem of split graphs
by: Couto, Fernanda, et al.
Published: (2024)

Elimination distance to bounded degree on planar graphs
by: Lindermayr, Alexander, et al.
Published: (2020)

On graph classes with constant domination-packing ratio
by: Bonamy, Marthe, et al.
Published: (2025)

Strong isometric path complexity of graphs: Asymptotic minors, restricted holes, and graph operations
by: Chakraborty, Dibyayan, et al.
Published: (2025)

Constant congestion brambles in directed graphs
by: Masařík, Tomáš, et al.
Published: (2021)

Fractional coloring with local demands and applications to degree-sequence bounds on the independence number
by: Kelly, Tom, et al.
Published: (2018)

Cops and robber in graphs with bounded vertex cover number
by: Bose, Prosenjit, et al.
Published: (2026)