On the 2-edge-coloured chromatic number of grids
From MaRDI portal
Publication:5206936
zbMATH Open1429.05059MaRDI QIDQ5206936FDOQ5206936
Authors: Julien Bensmail
Publication date: 19 December 2019
Full work available at URL: http://ajc.maths.uq.edu.au/pdf/75/ajc_v75_p365.pdf
Recommendations
Cites Work
- On the oriented chromatic number of grids
- Homomorphisms and colourings of oriented graphs: an updated survey
- Oriented chromatic number of grids is greater than 7
- A note on the oriented chromatic number of grids
- Acyclic and \(k\)-distance coloring of the grid
- Colored homomorphisms of colored mixed graphs
- Analogues of cliques for \((m,n)\)-colored mixed graphs
Cited In (9)
- Oriented chromatic number of Cartesian products and strong products of paths
- A note on the oriented chromatic number of grids
- On the oriented chromatic number of grids
- On the chromatic numbers of signed triangular and hexagonal grids
- Grid representations and the chromatic number
- 2-edge-colored chromatic number of grids is at most 9
- Signed coloring of 2-dimensional grids
- On the pushable chromatic number of various types of grids
- Properly charged coloring of two-dimensional arrays
This page was built for publication: On the 2-edge-coloured chromatic number of grids
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5206936)