Strong products of \(\chi\)-critical graphs

DOI10.1007/BF01855874zbMath0787.05039OpenAlexW4250749033MaRDI QIDQ1801332

Sandi Klavžar

Publication date: 19 May 1994

Published in: Aequationes Mathematicae (Search for Journal in Brave)

Full work available at URL: https://eudml.org/doc/137517

zbMATH Keywords

independence numberchromatic numberclique numbercritical graphsstrong productretractlexicographic product

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15) Graph theory (05C99)

Related Items (8)

On the chromatic number of the lexicographic product and the Cartesian sum of graphs ⋮ The independence number of the strong product of cycles ⋮ Coloring graph products---a survey ⋮ Acyclic coloring of products of digraphs ⋮ Unnamed Item ⋮ Unnamed Item ⋮ The chromatic numbers of graph bundles over cycles ⋮ On the fractional chromatic number and the lexicographic product of graphs

Cites Work

• Unnamed Item
• Factoring a graph in polynomial time
• Finding the prime factors of strong direct product graphs in polynomial time
• Retracts of strong products of graphs
• Two remarks on retracts of graph products
• Retract rigid Cartesian products of graphs
• A polynomial time algorithm for finding the prime factors of Cartesian- product graphs
• Isometric embeddings in Hamming graphs
• Cartesian graph factorization at logarithmic cost per edge
• r-tuple colorings of uniquely colorable graphs
• On Isometric Embeddings of Graphs
• On Factorable Extensions and Subgraphs of Prime Graphs
• On a Problem of C. E. Shannon in Graph Theory
• Independence numbers of product graphs

This page was built for publication: Strong products of \(\chi\)-critical graphs