Results 111 to 120 of about 414,139 (194)
Excluded-Minor Characterization of Apex-Outerplanar Graphs [PDF]
, 2016 The class of outerplanar graphs is minor-closed and can be characterized by two excluded minors: (Formula presented.) and (Formula presented.). The class of graphs that contain a vertex whose removal leaves an outerplanar graph is also minor-closed.
Ding, Guoli, Dziobiak, Stan
core +1 more source
External Memory Algorithms for Outerplanar Graphs
, 1999 We present external memory algorithms for outerplanarity testing, embedding outerplanar graphs, breadth-first search (BFS) and depth-first search (DFS) in outerplanar graphs, and finding a2-separator of size 2 for a given outerplanar graph.
Norbert Zeh +3 more
core +1 more source
Excluded-minor characterization of apex-outerplanar graphs [PDF]
, 2011 It is well known that the class of outerplanar graphs is minor-closed and can be characterized by two excluded minors: K_4 and K_{2,3}. The class of graphs that contain a vertex whose removal leaves an outerplanar graph is also minor-closed.
Dziobiak, Stanislaw
core +1 more source
On Separating Path and Tree Systems in Graphs [PDF]
Discrete Mathematics & Theoretical Computer ScienceWe explore the concept of separating systems of vertex sets of graphs. A separating system of a set $X$ is a collection of subsets of $X$ such that for any pair of distinct elements in $X$, there exists a set in the separating system that contains ...
Ahmad Biniaz +8 more
doaj +1 more source
Non-Preemptive Tree Packing. [PDF]
Algorithmica, 2023 Lendl S, Woeginger G, Wulf L.
europepmc +1 more source
Equitable colorings of outerplanar graphs
Discrete Mathematics, 2002 A proper vertex coloring of a graph \(G\) is said to be equitable if the sizes of any two color classes differ by at most 1. It was conjectured by \textit{H. P. Yap} and \textit{Y. Zhang} [Bull. Inst. Math., Acad. Sin. 25, 143-149 (1997; Zbl 0882.05054)] that every outerplanar graph with maximum degree at most \(\Delta\) admits an equitable \(k ...
openaire +1 more source
Mitochondrial networks through the lens of mathematics. [PDF]
Phys Biol, 2023 Lewis GR, Marshall WF.
europepmc +1 more source
Generating outerplanar graphs uniformly at random
, 2003 We show how to generate labeled and unlabeled outerplanar graphs with n vertices uniformly at random in polynomial time in n. To generate labeled outerplanar graphs, we present a counting technique using the decomposition of a graph according to its ...
Mihyun Kang, Manuel Bodirsky
core
The complexity of frugal colouring. [PDF]
Arab J Math, 2021 Bard S, MacGillivray G, Redlin S.
europepmc +1 more source
Truncated degree AT-orientations of outerplanar graphs [PDF]
An AT-orientation of a graph $G$ is an orientation $D$ of $G$ such that the number of even Eulerian sub-digraphs and the number of odd Eulerian sub-digraphs of $D$ are distinct. Given a mapping $f: V(G) \to \mathbb{N}$, we say $G$ is $f$-AT if $G$ has an
Deng, Chenglong, Zhu, Xuding
core +1 more source