z-logo
open-access-imgOpen Access
Neighbor sum distinguishing total choosability of planar graphs without 4-cycles adjacent to 3-cycles
Publication year - 2022
Publication title -
journal of mathematical and computational science
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 0.12
H-Index - 2
ISSN - 1927-5307
DOI - 10.28919/jmcs/7190
Subject(s) - combinatorics , mathematics , total coloring , graph , vertex (graph theory) , list coloring , planar graph , edge coloring , complete coloring , integer (computer science) , fractional coloring , discrete mathematics , graph power , computer science , line graph , programming language

The content you want is available to Zendy users.

Already have an account? Click here to sign in.
Having issues? You can contact us here
Accelerating Research

Address

John Eccles House
Robert Robinson Avenue,
Oxford Science Park, Oxford
OX4 4GP, United Kingdom