scientific article; zbMATH DE number 7666240
From MaRDI portal
Publication:5883509
Yair Caro, Mirko Petruševski, Riste Škrekovski
Publication date: 21 March 2023
Full work available at URL: http://ajc.maths.uq.edu.au/pdf/85/ajc_v85_p195.pdf
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Related Items (1)
Cites Work
- Graphs with chromatic number close to maximum degree
- Uniqueness of colorability and colorability of planar 4-regular graphs are NP-complete
- On an upper bound of the graph's chromatic number, depending on the graph's degree and density
- A strengthening of Brooks' theorem
- Linear cellular automata and the garden-of-eden
- Colorings with neighborhood parity condition
- Remarks on odd colorings of graphs
- Odd neighborhood transversals on grid graphs
- Odd and residue domination numbers of a graph
- On Complementary Graphs
- Unique-Maximum and Conflict-Free Coloring for Hypergraphs and Tree Graphs
- Connected odd dominating sets in graphs
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: