On near optimal colorable graphs
Fuente:
arXiv
Saved in:
| Main Authors: | Angeliya, C. U., Char, Arnab, Karthick, T. |
|---|---|
| Format: | Preprint |
| Published: |
2025
|
| Subjects: | |
| Online Access: | |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Similar Items
($P_2+P_4$, $K_4-e$)-free graphs are nearly $ω$-colorable
by: Angeliya, C. U., et al.
Published: (2025)
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)
by: Char, Arnab, et al.
Published: (2024)
$4K_1$-free graph with the cop number $3$
by: Char, Arnab, et al.
Published: (2025)
by: Char, Arnab, et al.
Published: (2025)
Linear colorings of graphs
by: Hilaire, Claire, et al.
Published: (2025)
by: Hilaire, Claire, et al.
Published: (2025)
Equitable coloring of sparse graphs
by: Liu, Weichan, et al.
Published: (2024)
by: Liu, Weichan, 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)
Equitable coloring of large bipartite graphs
by: Nikabadi, Amir
Published: (2026)
by: Nikabadi, Amir
Published: (2026)
Upper bounds on the average number of colors in the non-equivalent colorings of a graph
by: Hertz, Alain, et al.
Published: (2021)
by: Hertz, Alain, et al.
Published: (2021)
Odd coloring graphs with linear neighborhood complexity
by: Davies, James, et al.
Published: (2025)
by: Davies, James, et al.
Published: (2025)
Fast algorithm for $S$-packing coloring of Halin graphs
by: Zhang, Xin, et al.
Published: (2025)
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)
by: Dhawan, Abhishek, et al.
Published: (2025)
Restricted subgraphs of edge-colored graphs and applications
by: Sudakov, Benny
Published: (2024)
by: Sudakov, Benny
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)
On locating and neighbor-locating colorings of sparse graphs
by: Chakraborty, Dipayan, et al.
Published: (2023)
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)
by: Hertz, Alain, et al.
Published: (2021)
Strong odd colorings in graph classes of bounded expansion
by: Pilipczuk, Michał
Published: (2025)
by: Pilipczuk, Michał
Published: (2025)
List coloring ordered graphs with forbidden induced subgraphs
by: Piecyk, Marta, et al.
Published: (2025)
by: Piecyk, Marta, 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)
Winding number and circular 4-coloring of signed graphs
by: Gujgiczer, Anna, et al.
Published: (2023)
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)
by: Couto, Fernanda, et al.
Published: (2024)
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)
3-colorable planar graphs have an intersection segment representation using 3 slopes
by: Gonçalves, Daniel
Published: (2025)
by: Gonçalves, Daniel
Published: (2025)
A quasi-optimal upper bound for induced paths in sparse graphs
by: Couëtoux, Basile, et al.
Published: (2025)
by: Couëtoux, Basile, et al.
Published: (2025)
Characterizing optimal monitoring edge-geodetic sets for some structured graph classes
by: Foucaud, Florent, et al.
Published: (2025)
by: Foucaud, Florent, et al.
Published: (2025)
Flips in colorful triangulations
by: Acharya, Rohan, et al.
Published: (2024)
by: Acharya, Rohan, et al.
Published: (2024)
Some progress on $t$-tone coloring
by: Bennett, Patrick, et al.
Published: (2025)
by: Bennett, Patrick, et al.
Published: (2025)
Generalized DP-colorings of digraphs
by: Picasarri-Arrieta, Lucas, et al.
Published: (2025)
by: Picasarri-Arrieta, Lucas, et al.
Published: (2025)
Graceful coloring is computationally hard
by: Antony, Cyriac, et al.
Published: (2024)
by: Antony, Cyriac, et al.
Published: (2024)
Two questions on Kneser colorings
by: Inozemtsev, Eduard, et al.
Published: (2024)
by: Inozemtsev, Eduard, et al.
Published: (2024)
Fractional coloring via entropy
by: Dhawan, Abhishek
Published: (2026)
by: Dhawan, Abhishek
Published: (2026)
Balanced colorings of Erdős-Rényi hypergraphs
by: Dhawan, Abhishek, et al.
Published: (2025)
by: Dhawan, Abhishek, et al.
Published: (2025)
Balanced independent sets and colorings of hypergraphs
by: Dhawan, Abhishek
Published: (2023)
by: Dhawan, Abhishek
Published: (2023)
Multigraph edge-coloring with local list sizes
by: Dhawan, Abhishek
Published: (2023)
by: Dhawan, Abhishek
Published: (2023)
On universal graphs for trees and treewidth $k$ graphs
by: Kaul, Neel, et al.
Published: (2025)
by: Kaul, Neel, et al.
Published: (2025)
Hamiltonicity of Schrijver graphs and stable Kneser graphs
by: Mütze, Torsten, et al.
Published: (2024)
by: Mütze, Torsten, et al.
Published: (2024)
Note on polychromatic coloring of hereditary hypergraph families II
by: Pálvölgyi, Dömötör
Published: (2026)
by: Pálvölgyi, Dömötör
Published: (2026)
Determining a graph from its reconfiguration graph
by: Berthe, Gaétan, et al.
Published: (2025)
by: Berthe, Gaétan, et al.
Published: (2025)
Vertex-critical graphs in co-gem-free graphs
by: Beaton, Iain, et al.
Published: (2024)
by: Beaton, Iain, et al.
Published: (2024)
Effects of graph operations on star pairwise compatibility graphs
by: Monti, Angelo, et al.
Published: (2024)
by: Monti, Angelo, et al.
Published: (2024)
Single-conflict colorings of degenerate graphs
by: Bradshaw, Peter, et al.
Published: (2021)
by: Bradshaw, Peter, et al.
Published: (2021)
Similar Items
-
($P_2+P_4$, $K_4-e$)-free graphs are nearly $ω$-colorable
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) -
$4K_1$-free graph with the cop number $3$
by: Char, Arnab, et al.
Published: (2025) -
Linear colorings of graphs
by: Hilaire, Claire, et al.
Published: (2025) -
Equitable coloring of sparse graphs
by: Liu, Weichan, et al.
Published: (2024)