scientific article
From MaRDI portal
Publication:3410616
zbMath1141.05035MaRDI QIDQ3410616
Publication date: 29 November 2006
Full work available at URL: https://eudml.org/doc/31512
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Related Items (2)
On the geodetic and the hull numbers in strong product graphs ⋮ Game chromatic number of strong product graphs
Uses Software
Cites Work
- Finding the prime factors of strong direct product graphs in polynomial time
- Graph multiplication
- On the complexity of H-coloring
- A randomised 3-colouring algorithm
- The independence number of the strong product of cycles
- A randomized algorithm for \(k\)-colorability
- Strong products of \(\chi\)-critical graphs
- Coloring graph products---a survey
- Analogues of the Shannon Capacity of a Graph
- On the Shannon capacity of a graph
- Smallest independent dominating sets in Kronecker products of cycles
- Unnamed Item
- Unnamed Item
This page was built for publication:
