Pages that link to "Item:Q932658"
From MaRDI portal
The following pages link to On the adjacent vertex distinguishing total coloring numbers of graphs with \(\varDelta =3\) (Q932658):
Displaying 50 items.
- Neighbor sum distinguishing total choosability of planar graphs without 4-cycles (Q277657) (← links)
- Neighbor sum distinguishing total coloring of graphs embedded in surfaces of nonnegative Euler characteristic (Q281776) (← links)
- Neighbor distinguishing total choice number of sparse graphs via the combinatorial nullstellensatz (Q287913) (← links)
- Adjacent vertex distinguishing total colorings of 2-degenerate graphs (Q294532) (← links)
- A proper total coloring distinguishing adjacent vertices by sums of planar graphs without intersecting triangles (Q306111) (← links)
- The adjacent vertex distinguishing total chromatic number (Q442409) (← links)
- Neighbor sum distinguishing total colorings via the combinatorial nullstellensatz (Q477256) (← links)
- Neighbor sum distinguishing total colorings of planar graphs (Q498443) (← links)
- Neighbor sum distinguishing total choosability of planar graphs without adjacent triangles (Q501651) (← links)
- Relations of vertex distinguishing total chromatic numbers between a subgraph and its supergraph (Q508738) (← links)
- The adjacent vertex distinguishing total coloring of planar graphs without adjacent 4-cycles (Q511730) (← links)
- Neighbor product distinguishing total colorings (Q512884) (← links)
- AVD-total-chromatic number of some families of graphs with \(\Delta(G) = 3\) (Q516897) (← links)
- Adjacent vertex distinguishing total coloring of planar graphs with maximum degree 8 (Q785813) (← links)
- On the neighbor sum distinguishing total coloring of planar graphs (Q897872) (← links)
- The adjacent vertex distinguishing total choosability of planar graphs with maximum degree at least eleven (Q1698052) (← links)
- Neighbor sum distinguishing total coloring of sparse IC-planar graphs (Q1706133) (← links)
- On adjacent vertex-distinguishing total chromatic number of generalized Mycielski graphs (Q1750669) (← links)
- Graphs with bounded maximum average degree and their neighbor sum distinguishing total-choice numbers (Q1751539) (← links)
- A note on decycling number, vertex partition and AVD-total coloring in graphs (Q1756100) (← links)
- A note on the adjacent vertex distinguishing total chromatic number of graphs (Q1759396) (← links)
- A characterization for the neighbor-distinguishing total chromatic number of planar graphs with \(\varDelta = 13\) (Q1783617) (← links)
- On the AVDTC of 4-regular graphs (Q2017055) (← links)
- Neighbor product distinguishing total colorings of planar graphs with maximum degree at least ten (Q2042610) (← links)
- Neighbor sum distinguishing total colorings of corona of subcubic graphs (Q2045233) (← links)
- Strict neighbor-distinguishing total index of graphs (Q2131155) (← links)
- On adjacent-vertex-distinguishing total colourings of powers of cycles, hypercubes and lattice graphs (Q2132331) (← links)
- Adjacent vertex distinguishing total coloring in split graphs (Q2166305) (← links)
- On the \(D(2)\)-vertex distinguishing total coloring of graphs with \(\Delta=3\) (Q2170502) (← links)
- Neighbor product distinguishing total colorings of 2-degenerate graphs (Q2292128) (← links)
- Neighbor-distinguishing total coloring of planar graphs with maximum degree twelve (Q2292141) (← links)
- General vertex-distinguishing total coloring of graphs (Q2336778) (← links)
- AVD-total-colouring of complete equipartite graphs (Q2341767) (← links)
- On the total-neighbor-distinguishing index by sums (Q2345540) (← links)
- \(d\)-strong total colorings of graphs (Q2346331) (← links)
- Neighbor sum distinguishing total colorings of triangle free planar graphs (Q2355461) (← links)
- Adjacent vertex distinguishing total coloring of graphs with maximum degree 4 (Q2374166) (← links)
- Neighbor sum (set) distinguishing total choosability via the combinatorial Nullstellensatz (Q2409525) (← links)
- The adjacent vertex distinguishing total chromatic numbers of planar graphs with \(\Delta=10\) (Q2410091) (← links)
- Upper bounds on adjacent vertex distinguishing total chromatic number of graphs (Q2410247) (← links)
- Planar graphs with \(\Delta =9\) are neighbor-distinguishing totally 12-colorable (Q2424665) (← links)
- Adjacent vertex distinguishing total choosability of planar graphs with maximum degree at least 10 (Q2424800) (← links)
- The adjacent vertex distinguishing total coloring of planar graphs (Q2444142) (← links)
- Neighbor sum distinguishing total colorings of graphs with bounded maximum average degree (Q2452418) (← links)
- Neighbor sum distinguishing total colorings of \(K_4\)-minor free graphs (Q2514004) (← links)
- Neighbor sum (set) distinguishing total choosability of \(d\)-degenerate graphs (Q2631097) (← links)
- (Q3384719) (← links)
- 2-distance vertex-distinguishing total coloring of graphs (Q4634521) (← links)
- On the total and AVD-total coloring of graphs (Q4956171) (← links)
- Neighbor Sum Distinguishing Total Chromatic Number of Graphs with Lower Average Degree (Q6121343) (← links)
