Adjacent vertex distinguishing total colorings of outerplanar graphs
From MaRDI portal
Publication:965812
DOI10.1007/s10878-008-9165-xzbMath1216.05039OpenAlexW2091936359MaRDI QIDQ965812
Publication date: 26 April 2010
Published in: Journal of Combinatorial Optimization (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10878-008-9165-x
Related Items (33)
Neighbor sum distinguishing total choosability of planar graphs without 4-cycles ⋮ Neighbor sum distinguishing total coloring of graphs embedded in surfaces of nonnegative Euler characteristic ⋮ Neighbor distinguishing total choice number of sparse graphs via the combinatorial nullstellensatz ⋮ Strict neighbor-distinguishing total index of graphs ⋮ Adjacent vertex distinguishing total colorings of 2-degenerate graphs ⋮ Neighbor sum (set) distinguishing total choosability of \(d\)-degenerate graphs ⋮ Adjacent vertex distinguishing total coloring in split graphs ⋮ Neighbor sum (set) distinguishing total choosability via the combinatorial Nullstellensatz ⋮ The adjacent vertex distinguishing total chromatic numbers of planar graphs with \(\Delta=10\) ⋮ Upper bounds on adjacent vertex distinguishing total chromatic number of graphs ⋮ Planar graphs with \(\Delta =9\) are neighbor-distinguishing totally 12-colorable ⋮ On the neighbor sum distinguishing total coloring of planar graphs ⋮ Adjacent vertex distinguishing total choosability of planar graphs with maximum degree at least 10 ⋮ Total colorings-a survey ⋮ The adjacent vertex distinguishing total choosability of planar graphs with maximum degree at least eleven ⋮ Neighbor sum distinguishing total coloring of sparse IC-planar graphs ⋮ Unnamed Item ⋮ The adjacent vertex distinguishing total coloring of planar graphs ⋮ Neighbor sum distinguishing total colorings of graphs with bounded maximum average degree ⋮ Neighbor sum distinguishing total colorings via the combinatorial nullstellensatz ⋮ Neighbor sum distinguishing total colorings of planar graphs ⋮ Neighbor sum distinguishing total choosability of planar graphs without adjacent triangles ⋮ The adjacent vertex distinguishing total coloring of planar graphs without adjacent 4-cycles ⋮ Neighbor product distinguishing total colorings ⋮ AVD-total-chromatic number of some families of graphs with \(\Delta(G) = 3\) ⋮ On adjacent vertex-distinguishing total chromatic number of generalized Mycielski graphs ⋮ On the total and AVD-total coloring of graphs ⋮ Neighbor sum distinguishing total colorings of \(K_4\)-minor free graphs ⋮ Neighbor product distinguishing total colorings of planar graphs with maximum degree at least ten ⋮ Neighbor sum distinguishing total colorings of corona of subcubic graphs ⋮ Adjacent vertex distinguishing total coloring of planar graphs with maximum degree 8 ⋮ General vertex-distinguishing total coloring of graphs ⋮ AVD-total-colouring of complete equipartite graphs
Cites Work
This page was built for publication: Adjacent vertex distinguishing total colorings of outerplanar graphs
