Signed coloring of 2-dimensional grids
From MaRDI portal
Recommendations
- Concepts of signed graph coloring
- On colorings and orientations of signed graphs
- Edge coloring of signed graphs
- Edge coloring of graphs of signed class 1 and 2
- Coloring problem of signed interval graphs
- Signed colouring and list colouring of k‐chromatic graphs
- On the chromatic numbers of signed triangular and hexagonal grids
- Symmetric set coloring of signed graphs
- On some coloring problems in grids
- Colouring of generalized signed triangle-free planar graphs
Cites work
- scientific article; zbMATH DE number 6303010 (Why is no real title available?)
- A note on the oriented chromatic number of grids
- Acyclic and \(k\)-distance coloring of the grid
- Homomorphisms and colourings of oriented graphs: an updated survey
- Homomorphisms of 2-edge-colored graphs
- Homomorphisms of 2-edge-colored triangle-free planar graphs
- On the 2-edge-coloured chromatic number of grids
- On the notion of balance of a signed graph
- On the oriented chromatic number of grids
- Oriented chromatic number of grids is greater than 7
- Signed graphs
Cited in
(7)- Concepts of signed graph coloring
- On the chromatic numbers of signed triangular and hexagonal grids
- On the 2-edge-coloured chromatic number of grids
- 2-edge-colored chromatic number of grids is at most 9
- The general position number of integer lattices
- On the pushable chromatic number of various types of grids
- Properly charged coloring of two-dimensional arrays
This page was built for publication: Signed coloring of 2-dimensional grids
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2294442)
