scientific article; zbMATH DE number 1396705
From MaRDI portal
Publication:4936660
zbMath0931.05033MaRDI QIDQ4936660
Publication date: 31 January 2000
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Coloring of graphs and hypergraphs (05C15) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69)
Related Items (25)
Behzad-Vizing conjecture and Cartesian-product graphs ⋮ Dominating Cartesian products of cycles ⋮ On the domination number of cross products of graphs ⋮ Vizing's conjecture: A two-thirds bound for claw-free graphs ⋮ On the domination number of the Cartesian product of the cycle of length \(n\) and any graph ⋮ Equitable colorings of Kronecker products of graphs ⋮ On a Vizing-like conjecture for direct product graphs ⋮ The domination numbers of cylindrical grid graphs ⋮ A complete 4-parametric complexity classification of short shop scheduling problems ⋮ On the independence graph of a graph ⋮ A result on Vizing's conjecture ⋮ Interval edge-colorings of composition of graphs ⋮ A local prime factor decomposition algorithm ⋮ An introduction to multi-parameter complexity analysis of discrete problems ⋮ Optimal acyclic edge colouring of grid like graphs ⋮ Lower bounds for the domination number and the total domination number of direct product graphs ⋮ Some results on Vizing's conjecture and related problems ⋮ Pair lengths of product graphs ⋮ Computing the directed Cartesian-product decomposition of a directed graph from its undirected decomposition in linear time ⋮ On the packing chromatic number of Cartesian products, hexagonal lattice, and trees ⋮ Approximate graph products ⋮ Equitable colorings of Cartesian products of graphs ⋮ Prime interchange graphs of classes of matrices of zeros and ones ⋮ Cartesian products of graphs and metric spaces ⋮ Fractional domination of strong direct products
This page was built for publication:
