scientific article; zbMATH DE number 2230321

zbMath1075.05525MaRDI QIDQ5708617

Janez Žerovnik

Publication date: 18 November 2005

Full work available at URL: http://www.sciencedirect.com/science/journal/15710653

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

Mathematics Subject Classification ID

Paths and cycles (05C38) Coloring of graphs and hypergraphs (05C15)

Uses Software

• NISPOC

Cites Work

• Unnamed Item
• 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

This page was built for publication: