Results 1 to 10 of about 170,454 (272)
The structure and the list 3-dynamic coloring of outer-1-planar graphs [PDF]
Discrete Mathematics & Theoretical Computer Science, 2021 An outer-1-planar graph is a graph admitting a drawing in the plane so that all vertices appear in the outer region of the drawing and every edge crosses at most one other edge.
Yan Li, Xin Zhang
doaj +1 more source
Improved product structure for graphs on surfaces [PDF]
Discrete Mathematics & Theoretical Computer Science, 2022 Dujmovi\'c, Joret, Micek, Morin, Ueckerdt and Wood [J. ACM 2020] proved that for every graph $G$ with Euler genus $g$ there is a graph $H$ with treewidth at most 4 and a path $P$ such that $G\subseteq H \boxtimes P \boxtimes K_{\max\{2g,3\}}$. We improve
Marc Distel +3 more
doaj +1 more source
Mathematical Modelling and Control, 2021 In this paper, we study the problem of partitioning the vertex set of a planar graph with girth restriction into parts, also referred to as color classes, such that each part induces a graph with components of bounded order.
Chunyu Tian, Lei Sun
doaj +1 more source
Journal of Applied Clinical Medical Physics, Volume 23, Issue 12, December 2022., 2022 Abstract Purpose A set of treatment planning strategies were designed and retrospectively implemented for locally advanced, non‐small cell lung cancer (NSCLC) patients in order to minimize cardiac dose without compromising target coverage goals. Methods Retrospective analysis was performed for 20 NSCLC patients prescribed to 60–66 Gy that received a ...
Joshua P. Kim +5 more
wiley +1 more source
On the planarity of line Mycielskian graph of a graph
Ratio Mathematica, 2020 The line Mycielskian graph of a graph G, denoted by Lμ(G) is defined as the graph obtained from L(G) by adding q+1 new vertices E' = ei' : 1 ≤ i ≤ q and e, then for 1 ≤ i ≤ q , joining ei' to the neighbours of ei and to e.
Keerthi G. Mirajkar +1 more
doaj +1 more source
A small footprint couch‐top support device for image‐guided radiotherapy of heavy patients
Journal of Applied Clinical Medical Physics, Volume 23, Issue 12, December 2022., 2022 Abstract Purpose Patients with body weights close to or above 400 lbs present unique challenges in radiation therapy since the weight limit of most treatment couches decreases as the couch‐top extends toward the treatment gantry. The purpose of this work was to develop a small footprint couch‐top support platform to safely perform image‐guided ...
Huixiao Chen +5 more
wiley +1 more source
The k-subconnectedness of planar graphs
AIMS Mathematics, 2021 A graph G with at least 2k vertices is called k-subconnected if, for any 2k vertices x1,x2,⋯,x2k in G, there are k independent paths joining the 2k vertices in pairs in G.
Zongrong Qin, Dingjun Lou
doaj +1 more source
Volume staging for arteriovenous malformation SRS treatment using VMAT
Journal of Applied Clinical Medical Physics, Volume 23, Issue 12, December 2022., 2022 Abstract Volume staging involves dividing the target volume into smaller parts and treating each part separately. In this study, the feasibility of volume‐staged stereotactic radiosurgery (VS‐SRS) on a linear accelerator using volumetric modulated arc therapy (VMAT) and a frameless patient positioning system is investigated.
Claudia Mendez, Ermias Gete
wiley +1 more source
A bipartite graph associated to elements and cosets of subgroups of a finite group
AIMS Mathematics, 2021 Let $ G $ be a finite group. A bipartite graph associated to elements and cosets of subgroups of $ G $ is the simple undirected graph $ \Gamma(G) $ with the vertex set $ V(\Gamma(G)) = A\cup B $, where $ A $ is the set of all elements of a group $ G ...
Saba Al-Kaseasbeh, Ahmad Erfanian
doaj +1 more source
Links in projective planar graphs [PDF]
Involve 18 (2025) 199-238, 2022 A graph $G$ is nonseparating projective planar if $G$ has a projective planar embedding without a nonsplit link. Nonseparating projective planar graphs are closed under taking minors and are a superclass of projective outerplanar graphs. We partially characterize the minor-minimal separating projective planar graphs by proving that given a minor ...
arxiv +1 more source