Results 71 to 80 of about 3,997 (179)
The role of twins in computing planar supports of hypergraphs
, 2020 A support or realization of a hypergraph $H$ is a graph $G$ on the same vertex as $H$ such that for each hyperedge of $H$ it holds that its vertices induce a connected subgraph of $G$.
Kanj, Iyad A. +4 more
core
Crossing Minimization for 1-page and 2-page Drawings of Graphs with Bounded Treewidth
, 2014 We investigate crossing minimization for 1-page and 2-page book drawings. We show that computing the 1-page crossing number is fixed-parameter tractable with respect to the number of crossings, that testing 2-page planarity is fixed-parameter tractable ...
Bannister, Michael J., Eppstein, David
core +1 more source
Self‐avoiding walks and polygons on hyperbolic graphs
Journal of Graph Theory, Volume 106, Issue 3, Page 435-473, July 2024.Abstract We prove that for the d $d$‐regular tessellations of the hyperbolic plane by k $k$‐gons, there are exponentially more self‐avoiding walks of length n $n$ than there are self‐avoiding polygons of length n $n$. We then prove that this property implies that the self‐avoiding walk is ballistic, even on an arbitrary vertex‐transitive graph ...
Christoforos Panagiotis
wiley +1 more source
On the colorings of outerplanar graphs
Discrete Mathematics, 1995 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
openaire +1 more source
Random graphs embeddable in order‐dependent surfaces
Random Structures &Algorithms, Volume 64, Issue 4, Page 940-985, July 2024.Abstract Given a ‘genus function’ g=g(n)$$ g=g(n) $$, we let Eg$$ {\mathcal{E}}^g $$ be the class of all graphs G$$ G $$ such that if G$$ G $$ has order n$$ n $$ (i.e., has n$$ n $$ vertices) then it is embeddable in a surface of Euler genus at most g(n)$$ g(n) $$.
Colin McDiarmid, Sophia Saller
wiley +1 more source
Outerplanar and Forest Storyplans
An earlier version of this paper has appeared in Proc.
Jiří Fiala +4 more
openaire +2 more sources
On an interpolation property of outerplanar graphs
Discrete Applied Mathematics, 2006 Let \(D\) be an acyclic orientation of a graph \(G\). An arc of \(D\) is dependent if a directed cycle is created when it is reversed. Denote by \(d(D)\) the number of dependent arcs in \(D\). Let \(d_{\min}(G)\) be the minimum \(d(D)\), and \(d_{\max}(G)\) the maximum \(d(D)\), over all acyclic orientations \(D\) of \(G\).
Ko-Wei Lih, Chen-Ying Lin, Li-Da Tong
openaire +1 more source
On tree decompositions whose trees are minors
Journal of Graph Theory, Volume 106, Issue 2, Page 296-306, June 2024.Abstract In 2019, Dvořák asked whether every connected graph G $G$ has a tree decomposition ( T , B ) $(T,{\rm{ {\mathcal B} }})$ so that T $T$ is a subgraph of G $G$ and the width of ( T , B ) $(T,{\rm{ {\mathcal B} }})$ is bounded by a function of the treewidth of G $G$.
Pablo Blanco +5 more
wiley +1 more source
Algorithm-based radio labeling for optimal channel assignment in outerplanar graphs
Frontiers in Computer ScienceIntroductionRadio labeling of graphs extends the channel assignment problem by assigning non-negative integers to vertices of a connected graph G such that |h(℘)−h(𝓆)|≥diam(ℊ)+1−d(℘, 𝓆).
Baskar Mari, Ravi Sankar Jeyaraj
doaj +1 more source
A graph and its complement with specified properties I: connectivity
International Journal of Mathematics and Mathematical Sciences, 1979 We investigate the conditions under which both a graph G and its complement G¯ possess a specified property. In particular, we characterize all graphs G for which G and G¯ both (a) have connectivity one, (b) have line-connectivity one, (c) are 2 ...
Jin Akiyama, Frank Harary
doaj +1 more source