scientific article; zbMATH DE number 1396705
From MaRDI portal
Recommendations
Cited in
(33)- Coloring Graphs with Constraints on Connectivity
- On a type of assigning a colour from given sets to the edges of a graph
- Vizing's conjecture: A two-thirds bound for claw-free graphs
- Precoloring Extension for 2‐connected Graphs
- On the packing chromatic number of Cartesian products, hexagonal lattice, and trees
- Dominating Cartesian products of cycles
- On the domination number of cross products of graphs
- Precoloring extension for 2-connected graphs with maximum degree three
- A local prime factor decomposition algorithm
- Behzad-Vizing conjecture and Cartesian-product graphs
- An introduction to multi-parameter complexity analysis of discrete problems
- scientific article; zbMATH DE number 179462 (Why is no real title available?)
- Cartesian products of graphs and metric spaces
- On the independence graph of a graph
- On a Vizing-like conjecture for direct product graphs
- A result on Vizing's conjecture
- scientific article; zbMATH DE number 1560505 (Why is no real title available?)
- Approximate graph products
- On the existence of graphs with prescribed coloring parameters
- 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
- Pair lengths of product 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
- The domination numbers of cylindrical grid graphs
- Interval edge-colorings of composition of graphs
- Fractional domination of strong direct products
- On the domination number of the Cartesian product of the cycle of length \(n\) and any graph
- Optimal acyclic edge colouring of grid like graphs
- Equitable colorings of Kronecker products of graphs
- Hard-to-color graphs for connected sequential colorings
- Prime interchange graphs of classes of matrices of zeros and ones
- Equitable colorings of Cartesian products 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)
