Extremal edge general position sets in some graphs

DOI10.1007/s00373-024-02770-zarXiv2302.01587OpenAlexW4393192741MaRDI QIDQ6131296

Elif Tan, Sandi Klavžar, Jing Tian

Publication date: 4 April 2024

Published in: Graphs and Combinatorics (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/2302.01587

zbMATH Keywords

block graphcut-vertexdiametral pathgeneral position setedge general position set

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Paths and cycles (05C38) Distance in graphs (05C12)

Cites Work

• On the extremal combinatorics of the Hamming space
• On general position sets in Cartesian products
• The semitotal domination problem in block graphs
• On the general position number of two classes of graphs
• The edge general position problem
• Maximum number of subtrees in cacti and block graphs
• The general position number of Cartesian products involving a factor with small diameter
• A GENERAL POSITION PROBLEM IN GRAPH THEORY
• On the general position problem on Kneser graphs
• General position sets in two families of Cartesian product graphs
• TRAVERSING A GRAPH IN GENERAL POSITION
• On the general position numbers of maximal outerplane graphs
• Edge general position sets in Fibonacci and Lucas cubes

This page was built for publication: Extremal edge general position sets in some graphs