More results on the $z$-chromatic number of graphs
Fuente:
arXiv
Saved in:
| Main Authors: | Khaleghi, Abbas, Zaker, Manouchehr |
|---|---|
| Format: | Preprint |
| Published: |
2023
|
| Subjects: | |
| Online Access: | |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Similar Items
A new vertex coloring heuristic and corresponding chromatic number
by: Zaker, Manouchehr
Published: (2020)
by: Zaker, Manouchehr
Published: (2020)
$\mathcal{O}(VE)$ time algorithms for the Grundy (First-Fit) chromatic number of block graphs and graphs with sufficiently large girth
by: Zaker, Manouchehr
Published: (2024)
by: Zaker, Manouchehr
Published: (2024)
On z-coloring and ${\rm b}^{\ast}$-coloring of graphs as improved variants of the b-coloring
by: Zaker, Manouchehr
Published: (2024)
by: Zaker, Manouchehr
Published: (2024)
Bounds for the Grundy chromatic number of graphs in terms of domination number
by: Khaleghi, Abbas, et al.
Published: (2022)
by: Khaleghi, Abbas, et al.
Published: (2022)
Partial vertex covers and the complexity of some problems concerning static and dynamic monopolies
by: Soltani, Hossein, et al.
Published: (2018)
by: Soltani, Hossein, et al.
Published: (2018)
More algorithmic results for problems of spread of influence in edge-weighted graphs with and without incentives
by: Askari, Siavash, et al.
Published: (2024)
by: Askari, Siavash, et al.
Published: (2024)
More relations between $λ$-labeling and Hamiltonian paths with emphasis on line graph of bipartite multigraphs
by: Zaker, Manouchehr
Published: (2021)
by: Zaker, Manouchehr
Published: (2021)
On cuts of small chromatic number in sparse graphs
by: Aubian, Guillaume, et al.
Published: (2025)
by: Aubian, Guillaume, et al.
Published: (2025)
On irreversible spread of influence in edge-weighted graphs
by: Zaker, Manouchehr
Published: (2019)
by: Zaker, Manouchehr
Published: (2019)
On $(n,m)$-chromatic numbers of graphs having bounded sparsity parameters
by: Das, Sandip, et al.
Published: (2023)
by: Das, Sandip, et al.
Published: (2023)
The chromatic number of triangle-free hypergraphs
by: Li, Lina, et al.
Published: (2022)
by: Li, Lina, et al.
Published: (2022)
Linear versus centred chromatic numbers
by: Bose, Prosenjit, et al.
Published: (2022)
by: Bose, Prosenjit, et al.
Published: (2022)
Burling graphs in graphs with large chromatic number
by: Abrishami, Tara, et al.
Published: (2025)
by: Abrishami, Tara, et al.
Published: (2025)
Balanced-chromatic number and Hadwiger-like conjectures
by: Jiménez, Andrea, et al.
Published: (2023)
by: Jiménez, Andrea, et al.
Published: (2023)
The strong chromatic index of $K_{t,t}$-free graphs
by: Bi, Richard, et al.
Published: (2026)
by: Bi, Richard, et al.
Published: (2026)
Bounding the chromatic number of dense digraphs by arc neighborhoods
by: Klingelhoefer, Felix, et al.
Published: (2023)
by: Klingelhoefer, Felix, et al.
Published: (2023)
On acyclic b-chromatic number of cubic graphs
by: Anholcer, Marcin, et al.
Published: (2025)
by: Anholcer, Marcin, et al.
Published: (2025)
Packing chromatic critical graphs with radius at most 2
by: Gür, Aslıhan, et al.
Published: (2026)
by: Gür, Aslıhan, et al.
Published: (2026)
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)
Off-diagonal Rado number for $x+y+c=z$ and $x+qy=z$
by: Adak, Rajat, et al.
Published: (2026)
by: Adak, Rajat, et al.
Published: (2026)
EPPA numbers of graphs
by: Bradley-Williams, David, et al.
Published: (2023)
by: Bradley-Williams, David, et al.
Published: (2023)
Three-chromatic geometric hypergraphs
by: Damásdi, Gábor, et al.
Published: (2021)
by: Damásdi, Gábor, et al.
Published: (2021)
Cop numbers of periodic graphs
by: De Carufel, Jean-Lou, et al.
Published: (2023)
by: De Carufel, Jean-Lou, et al.
Published: (2023)
Dichromatic number of chordal graphs
by: Bessy, Stéphane, et al.
Published: (2023)
by: Bessy, Stéphane, et al.
Published: (2023)
On the inversion number of oriented graphs
by: Bang-Jensen, Jørgen, et al.
Published: (2021)
by: Bang-Jensen, Jørgen, et al.
Published: (2021)
An improvement on the bound for the acyclic chromatic index
by: Kirousis, Lefteris, et al.
Published: (2026)
by: Kirousis, Lefteris, et al.
Published: (2026)
Conflict-free chromatic index of trees
by: Guo, Shanshan, et al.
Published: (2024)
by: Guo, Shanshan, et al.
Published: (2024)
Acyclic dichromatic number of oriented graphs
by: Bang-Jensen, Jørgen, et al.
Published: (2025)
by: Bang-Jensen, Jørgen, et al.
Published: (2025)
Circular chromatic index of small graphs
by: Mazák, Ján, et al.
Published: (2026)
by: Mazák, Ján, et al.
Published: (2026)
The Frank number and nowhere-zero flows on graphs
by: Goedgebeur, Jan, et al.
Published: (2023)
by: Goedgebeur, Jan, et al.
Published: (2023)
Biclique immersions in graphs with independence number 2
by: Botler, Fábio, et al.
Published: (2023)
by: Botler, Fábio, et al.
Published: (2023)
Winding number and circular 4-coloring of signed graphs
by: Gujgiczer, Anna, et al.
Published: (2023)
by: Gujgiczer, Anna, et al.
Published: (2023)
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)
Weak coloring numbers of minor-closed graph classes
by: Hodor, Jędrzej, et al.
Published: (2024)
by: Hodor, Jędrzej, et al.
Published: (2024)
Representation number of word-representable co-bipartite graph
by: Das, Biswajit, et al.
Published: (2025)
by: Das, Biswajit, et al.
Published: (2025)
Three-dimensional graph products with unbounded stack-number
by: Eppstein, David, et al.
Published: (2022)
by: Eppstein, David, et al.
Published: (2022)
Cops and robber in graphs with bounded vertex cover number
by: Bose, Prosenjit, et al.
Published: (2026)
by: Bose, Prosenjit, et al.
Published: (2026)
Improved bounds on the zeros of the chromatic polynomial of graphs and claw-free graphs
by: Bencs, Ferenc, et al.
Published: (2025)
by: Bencs, Ferenc, et al.
Published: (2025)
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)
Tree-independence number of $P_5$-free graphs with no large bicliques
by: Blažej, Václav, et al.
Published: (2026)
by: Blažej, Václav, et al.
Published: (2026)
Similar Items
-
A new vertex coloring heuristic and corresponding chromatic number
by: Zaker, Manouchehr
Published: (2020) -
$\mathcal{O}(VE)$ time algorithms for the Grundy (First-Fit) chromatic number of block graphs and graphs with sufficiently large girth
by: Zaker, Manouchehr
Published: (2024) -
On z-coloring and ${\rm b}^{\ast}$-coloring of graphs as improved variants of the b-coloring
by: Zaker, Manouchehr
Published: (2024) -
Bounds for the Grundy chromatic number of graphs in terms of domination number
by: Khaleghi, Abbas, et al.
Published: (2022) -
Partial vertex covers and the complexity of some problems concerning static and dynamic monopolies
by: Soltani, Hossein, et al.
Published: (2018)