A note on 3‐partite graphs without 4‐cycles
Sign Up to like & getrecommendations! Published in 2020 at "Journal of Combinatorial Designs"
DOI: 10.1002/jcd.21742
Abstract: Let C4 be a cycle of order 4. Write ex(n,n,n,C4) for the maximum number of edges in a balanced 3‐partite graph whose vertex set consists of three parts, each has n vertices that have no… read more here.
Keywords: graphs without; note partite; without cycles; partite graphs ... See more keywords
List 2-distance $$\varDelta +3$$Δ+3-coloring of planar graphs without 4,5-cycles
Sign Up to like & getrecommendations! Published in 2018 at "Journal of Combinatorial Optimization"
DOI: 10.1007/s10878-018-0312-8
Abstract: Let $$\chi _2(G)$$χ2(G) and $$\chi _2^l(G)$$χ2l(G) be the 2-distance chromatic number and list 2-distance chromatic number of a graph G, respectively. Wegner conjectured that for each planar graph G with maximum degree $$\varDelta $$Δ at… read more here.
Keywords: distance; list distance; without cycles; vardelta ... See more keywords
Adjacent Vertex Distinguishing Edge Coloring of Planar Graphs Without 4-Cycles
Sign Up to like & getrecommendations! Published in 2019 at "Bulletin of the Malaysian Mathematical Sciences Society"
DOI: 10.1007/s40840-019-00860-3
Abstract: The adjacent vertex distinguishing edge coloring of a graph G is a proper edge coloring of G such that the edge coloring set on any pair of adjacent vertices is distinct. The minimum number of… read more here.
Keywords: vertex distinguishing; adjacent vertex; edge; edge coloring ... See more keywords