Cover Image

($P_2+P_4$, $K_4-e$)-free graphs are nearly $ω$-colorable

Fuente: arXiv

Saved in:

Bibliographic Details
Main Authors:	Angeliya, C. U., Karthick, T., Huang, Shenwei
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 near optimal colorable graphs
by: Angeliya, C. U., et al.
Published: (2025)

An optimal chromatic bound for ($P_2+P_3$, gem)-free graphs
by: Char, Arnab, et al.
Published: (2024)

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

Secure domination in $P_5$-free graphs
by: Gupta, Uttam K., et al.
Published: (2025)

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

Tree-independence number of $P_5$-free graphs with no large bicliques
by: Blažej, Václav, et al.
Published: (2026)

2-distance 4-coloring of planar subcubic graphs with girth at least 21
by: La, Hoang, et al.
Published: (2021)

On the finiteness of $k$-vertex-critical $2P_2$-free graphs with forbidden induced squids or bulls
by: Adekanye, Melvin, et al.
Published: (2024)

The strong chromatic index of $K_{t,t}$-free graphs
by: Bi, Richard, et al.
Published: (2026)

On the structure of ($4K_1$, $C_4$, $P_6$)-free graphs
by: Hoàng, Chính T., et al.
Published: (2025)

Maximum list $r$-colorable induced subgraphs in $kP_3$-free graphs
by: Galby, Esther, et al.
Published: (2025)

Separating the edges of a graph by cycles and by subdivisions of $K_4$
by: Botler, Fábio, et al.
Published: (2024)

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

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

$K_{2,3}$-induced minor-free graphs admit quasi-isometry with additive distortion to graphs of tree-width at most two
by: Chakraborty, Dibyayan
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)

Centered colorings and weak coloring numbers in minor-closed graph classes
by: Hodor, Jędrzej, et al.
Published: (2026)

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

$4K_1$-free graph with the cop number $3$
by: Char, Arnab, 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)

Vertex-critical graphs in subfamilies of $(P_4+\ell P_1)$-free graphs
by: Beaton, Iain, et al.
Published: (2026)

Cops and robbers on $P_5$-free graphs
by: Chudnovsky, Maria, et al.
Published: (2023)

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)

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

Centered colorings in minor-closed graph classes
by: Hodor, Jędrzej, et al.
Published: (2024)

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

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)

Strong odd colorings in graph classes of bounded expansion
by: Pilipczuk, Michał
Published: (2025)

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

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

Vertex-critical graphs in co-gem-free graphs
by: Beaton, Iain, et al.
Published: (2024)

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

$θ$-free matching covered graphs
by: Joshi, Rohinee, et al.
Published: (2024)

Coloring bridge-free antiprismatic graphs
by: Robin, Cléophée, et al.
Published: (2024)

Hitting all longest paths in $H$-free graphs and $H$-graphs
by: de Lima, Paloma T., et al.
Published: (2025)

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

Nucleation-free independent graphs with implied nonedges
by: Cheng, Jialong, et al.
Published: (2025)

Proper conflict-free choosability of planar graphs
by: Wang, Yuting, et al.
Published: (2025)

Computing fixed point free automorphisms of graphs
by: Abiad, Aida, et al.
Published: (2026)