scientific article; zbMATH DE number 1396705
From MaRDI portal
zbMATH Open0931.05033MaRDI QIDQ4936660FDOQ4936660
Authors: V. G. Vizing 
Publication date: 31 January 2000
Title of this publication is not available (Why is that?)
Recommendations
Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69) Coloring of graphs and hypergraphs (05C15)
Cited In (33)
- Optimal acyclic edge colouring of grid like graphs
- A local prime factor decomposition algorithm
- Equitable colorings of Kronecker products of graphs
- Title not available (Why is that?)
- Approximate graph products
- Some results on Vizing's conjecture and related problems
- Behzad-Vizing conjecture and Cartesian-product graphs
- Prime interchange graphs of classes of matrices of zeros and ones
- Coloring Graphs with Constraints on Connectivity
- Fractional domination of strong direct products
- Title not available (Why is that?)
- The domination numbers of cylindrical grid graphs
- On the packing chromatic number of Cartesian products, hexagonal lattice, and trees
- On a type of assigning a colour from given sets to the edges of a graph
- Lower bounds for the domination number and the total domination number of direct product graphs
- Precoloring Extension for 2‐connected Graphs
- Equitable colorings of Cartesian products of graphs
- On the independence graph of a graph
- Pair lengths of product graphs
- On the domination number of the Cartesian product of the cycle of length \(n\) and any graph
- A complete 4-parametric complexity classification of short shop scheduling problems
- Computing the directed Cartesian-product decomposition of a directed graph from its undirected decomposition in linear time
- Dominating Cartesian products of cycles
- Precoloring extension for 2-connected graphs with maximum degree three
- Vizing's conjecture: A two-thirds bound for claw-free graphs
- On the domination number of cross products of graphs
- On a Vizing-like conjecture for direct product graphs
- Hard-to-color graphs for connected sequential colorings
- An introduction to multi-parameter complexity analysis of discrete problems
- A result on Vizing's conjecture
- On the existence of graphs with prescribed coloring parameters
- Cartesian products of graphs and metric spaces
- Interval edge-colorings of composition of graphs
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4936660)
