Chrome Extension
WeChat Mini Program
Use on ChatGLM

Anti-van der Waerden Numbers of Some 2-Connected Outerplanar Graphs

JOURNAL OF INTERCONNECTION NETWORKS(2024)

Cited 0|Views0
No score
Abstract
Given a graph G and a positive integer k, the anti-van der Waerden number aw(G,k) is defined as the minimum positive integer r such that every exact r-coloring of the vertices of G admits a rainbow k-AP. In this paper, we determine the exact value of aw(G, 3) if G is a 2-connected outerplanar graph with diameters 2, 3.
More
Translated text
Key words
Anti-van der Waerden number,outerplanar graph,rainbow arithmetic progression
AI Read Science
Must-Reading Tree
Example
Generate MRT to find the research sequence of this paper
Chat Paper
Summary is being generated by the instructions you defined