THE GENERAL POSITION NUMBER OF THE CARTESIAN PRODUCT OF TWO TREES
From MaRDI portal
Publication:4999610
DOI10.1017/S0004972720001276zbMath1467.05211arXiv2009.07305MaRDI QIDQ4999610
Kexiang Xu, Jing Tian, Sandi Klavžar
Publication date: 7 July 2021
Published in: Bulletin of the Australian Mathematical Society (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/2009.07305
Trees (05C05) Extremal problems in graph theory (05C35) Paths and cycles (05C38) Distance in graphs (05C12) Graph operations (line graphs, products, etc.) (05C76)
Related Items (12)
The general position achievement game played on graphs ⋮ General position sets in two families of Cartesian product graphs ⋮ TRAVERSING A GRAPH IN GENERAL POSITION ⋮ Total mutual-visibility in graphs with emphasis on lexicographic and Cartesian products ⋮ On the general position numbers of maximal outerplane graphs ⋮ The general position avoidance game and hardness of general position games ⋮ A Steiner general position problem in graph theory ⋮ On general position sets in Cartesian products ⋮ On the general position number of two classes of graphs ⋮ The edge general position problem ⋮ On the mutual visibility in Cartesian products and triangle-free graphs ⋮ General d-position sets
Cites Work
- \(b\)-coloring of Cartesian product of trees
- On the extremal combinatorics of the Hamming space
- The general position problem and strong resolving graphs
- Characterization of general position sets and its applications to cographs and bipartite graphs
- The general position number of integer lattices
- The Graph Theory General Position Problem on Some Interconnection Networks
- A GENERAL POSITION PROBLEM IN GRAPH THEORY
- On the general position problem on Kneser graphs
- Unnamed Item
- Unnamed Item
This page was built for publication: THE GENERAL POSITION NUMBER OF THE CARTESIAN PRODUCT OF TWO TREES