scientific article; zbMATH DE number 3349876
From MaRDI portal
Publication:5625208
zbMath0221.05062MaRDI QIDQ5625208
Publication date: 1971
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Related Items (20)
Behzad-Vizing conjecture and Cartesian-product graphs ⋮ List-colourings of graphs ⋮ The total chromatic number of any multigraph with maximum degree five is at most seven ⋮ Total chromatic number and some topological indices ⋮ Unnamed Item ⋮ Total colorings of product graphs ⋮ An upper bound for total colouring of graphs ⋮ Nombre chromatique total d'un hypergraphe ⋮ The determination of the total chromatic number of series-parallel graphs with \((G) \geq 4\) ⋮ On topological relaxations of chromatic conjectures ⋮ Nombre chromatique total du joint d'un ensemble stable par un cycle ⋮ Edge and total coloring of interval graphs ⋮ Graph theory ⋮ Generalized fractional total colorings of graphs ⋮ A new upper bound for total colourings of graphs ⋮ Behzad-Vizing conjecture and Cartesian product graphs ⋮ Total colouring regular bipartite graphs is NP-hard ⋮ Total colorings of certain classes of lexicographic product graphs ⋮ Fractional total colouring ⋮ Total colorings of circulant graphs
This page was built for publication:
