Hardness and efficiency on t-admissibility for graph operations

2021 ◽  
Vol 304 ◽  
pp. 342-348
Author(s):  
Fernanda Couto ◽  
Luís Felipe I. Cunha
Keyword(s):  
2019 ◽  
Vol 10 (2) ◽  
pp. 301-309
Author(s):  
A. Bharali ◽  
Amitav Doley

10.37236/1734 ◽  
2003 ◽  
Vol 10 (1) ◽  
Author(s):  
David Arthur

An arc-representation of a graph is a function mapping each vertex in the graph to an arc on the unit circle in such a way that adjacent vertices are mapped to intersecting arcs. The width of such a representation is the maximum number of arcs passing through a single point. The arc-width of a graph is defined to be the minimum width over all of its arc-representations. We extend the work of Barát and Hajnal on this subject and develop a generalization we call restricted arc-width. Our main results revolve around using this to bound arc-width from below and to examine the effect of several graph operations on arc-width. In particular, we completely describe the effect of disjoint unions and wedge sums while providing tight bounds on the effect of cones.


2020 ◽  
Author(s):  
M. Radhakrishnan ◽  
M. Suresh ◽  
V. Mohana Selvi

2019 ◽  
Vol 47 (5) ◽  
pp. 1985-1996 ◽  
Author(s):  
Mehrdad Nasernejad ◽  
Kazem Khashyarmanesh ◽  
Ibrahim Al-Ayyoub

2021 ◽  
Author(s):  
Bing Yao ◽  
Xiaohui Zhang ◽  
Jing Su ◽  
Hui Sun ◽  
Hongyu Wang

2011 ◽  
Vol 159 (13) ◽  
pp. 1323-1330 ◽  
Author(s):  
G.H. Fath-Tabar ◽  
B. Vaez-Zadeh ◽  
A.R. Ashrafi ◽  
A. Graovac

Sign in / Sign up

Export Citation Format

Share Document