scientific article
From MaRDI portal
Publication:3815316
zbMath0664.05017MaRDI QIDQ3815316
Zhong Fu Zhang, Jian-fang Wang, Jian-Xun Zhang
Publication date: 1988
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Related Items (16)
Total chromatic number of {square,unichord}-free graphs ⋮ On the colorings of outerplanar graphs ⋮ \(D(\beta)\)-vertex-distinguishing total coloring of graphs ⋮ The total chromatic number of pseudo-outerplanar graphs ⋮ Total coloring of outer-1-planar graphs with near-independent crossings ⋮ Total chromatic number of unichord-free graphs ⋮ Equitable total chromatic number of splitting graph ⋮ Complexity of colouring problems restricted to unichord-free and square, unichord-free graphs ⋮ Recent results on the total chromatic number ⋮ The determination of the total chromatic number of series-parallel graphs with \((G) \geq 4\) ⋮ On the edge-binding number of some plane graphs ⋮ Total coloring of outer-1-planar graphs: the cold case ⋮ Equitable total coloring of \(F_n \vee W_n\) ⋮ Adjacent strong edge colorings and total colorings of regular graphs ⋮ Choosability, edge choosability and total choosability of outerplane graphs ⋮ The total chromatic number of some bipartite graphs
This page was built for publication:
