Vizing-like conjecture for the upper domination of Cartesian products of graphs -- the proof.
Brešar, Boštjan (2005)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
Displaying similar documents to “Matrix partitions with finitely many obstructions.”
Vizing-like conjecture for the upper domination of Cartesian products of graphs -- the proof.
On domatic numbers of graphs
Bohdan Zelinka (1981)
Mathematica Slovaca
Similarity:
Semidomatic and total semidomatic numbers of directed graphs
Bohdan Zelinka (1992)
Mathematica Bohemica
Similarity:
Certain numerical invariants of directed graphs, analogous to the domatic number and to the total domatic number of an undirected graph, are introduced and studied.
Some constructions of -minimal graphs
Francesco Regonati, N. Zagaglia Salvi (1994)
Czechoslovak Mathematical Journal
Similarity:
Adomatic and idomatic numbers of graphs
Bohdan Zelinka (1983)
Mathematica Slovaca
Similarity:
Tiling tripartite graphs with 3-colorable graphs.
Martin, Ryan, Zhao, Yi (2009)
The Electronic Journal of Combinatorics [electronic only]
Similarity: