Pages that link to "Item:Q897872"
From MaRDI portal
The following pages link to On the neighbor sum distinguishing total coloring of planar graphs (Q897872):
Displaying 32 items.
- Neighbor sum distinguishing total choosability of planar graphs without adjacent triangles (Q501651) (← links)
- The adjacent vertex distinguishing total coloring of planar graphs without adjacent 4-cycles (Q511730) (← links)
- Adjacent vertex distinguishing total coloring of planar graphs with maximum degree 8 (Q785813) (← links)
- Neighbor sum distinguishing total chromatic number of 2-degenerate graphs (Q1627882) (← links)
- Neighbor sum distinguishing total coloring of planar graphs without 4-cycles (Q1679510) (← 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)
- Adjacent vertex distinguishing total coloring of planar graphs with maximum degree 9 (Q1732773) (← links)
- Neighbor sum distinguishing total chromatic number of planar graphs with maximum degree 10 (Q1740118) (← links)
- Graphs with bounded maximum average degree and their neighbor sum distinguishing total-choice numbers (Q1751539) (← links)
- Neighbor sum distinguishing total coloring of triangle free IC-planar graphs (Q1987570) (← 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)
- Neighbor sum distinguishing total choosability of planar graphs without adjacent special 5-cycles (Q2181224) (← links)
- Neighbor sum distinguishing total coloring of IC-planar graphs with short cycle restrictions (Q2181235) (← links)
- Improved bounds for neighbor sum (set) distinguishing choosability of planar graphs (Q2182186) (← links)
- Neighbor sum distinguishing total coloring of IC-planar graphs (Q2185920) (← links)
- Neighbor sum distinguishing index of sparse graphs (Q2194737) (← links)
- Neighbor sum distinguishing total chromatic number of planar graphs without 5-cycles (Q2282476) (← links)
- Neighbor sum distinguishing total choosability of IC-planar graphs (Q2282486) (← links)
- Neighbor sum distinguishing total colorings of IC-planar graphs with maximum degree 13 (Q2292143) (← links)
- Neighbor sum distinguishing total chromatic number of planar graphs (Q2333237) (← links)
- Neighbor sum distinguishing total coloring of planar graphs without 5-cycles (Q2402272) (← links)
- Neighbor sum distinguishing total chromatic number of \(K_4\)-minor free graph (Q2405976) (← links)
- Neighbor sum distinguishing total coloring of 2-degenerate graphs (Q2410029) (← links)
- Total coloring of planar graphs without adjacent chordal 6-cycles (Q2410046) (← links)
- Adjacent vertex distinguishing total choosability of planar graphs with maximum degree at least 10 (Q2424800) (← links)
- A note on the neighbor sum distinguishing total coloring of planar graphs (Q2629242) (← links)
- Neighbor sum distinguishing total choosability of planar graphs with maximum degree at least 10 (Q6178525) (← links)
- Neighbor sum distinguishing total coloring of planar graphs with restrained cycles (Q6637047) (← links)
- Neighbor sum distinguishing total choosability of planar graphs without intersecting 4-cycles (Q6657249) (← links)
- Neighbor product distinguishing total coloring of planar graphs without 5-cycles (Q6661065) (← links)
