Results 111 to 120 of about 4,003 (201)
On Colorings of Squares of Outerplanar Graphs
, 2004 We study vertex colorings of the square $G^2$ of an outerplanar graph $G$. We find the optimal bound of the inductiveness, chromatic number and the clique number of $G^2$ as a function of the maximum degree $ $ of $G$ for all $ \in \nats$. As a bonus, we obtain the optimal bound of the choosability (or the list-chromatic number) of $G^2$ when $ \geq
Magnús M. Halldórsson, Geir Agnarsson
openaire +3 more sources
Non-Preemptive Tree Packing. [PDF]
Algorithmica, 2023 Lendl S, Woeginger G, Wulf L.
europepmc +1 more source
Linear Algorithms for Isomorphism of Maximal Outerplanar Graphs [PDF]
, 1979 S. Mitchell, Terry Beyer, Whitney Jones
openalex +1 more source
Outerplanar Coarseness of Planar Graphs [PDF]
Missouri Journal of Mathematical Sciences, 2016 The (outer) planar coarseness of a graph is the largest number of pairwise-edge-disjoint non-(outer)planar subgraphs. It is shown that the maximum outerplanar coarseness, over all $n$-vertex planar graphs, lies in the interval $\;\big [\lfloor (n-2)/3 \rfloor, \lfloor (n-2)/2 \rfloor \big ]$.
openaire +3 more sources
Discussiones Mathematicae Graph Theory, 2013 A path-neighborhood graph is a connected graph in which every neighborhood induces a path. In the main results the 3-sun-free path-neighborhood graphs are characterized.
Laskar R.C., Mulder Henry Martyn
doaj +1 more source
Mitochondrial networks through the lens of mathematics. [PDF]
Phys Biol, 2023 Lewis GR, Marshall WF.
europepmc +1 more source
On the k-Structure Ratio in Planar and Outerplanar Graphs
Discrete Mathematics & Theoretical Computer Science, 2008 A planar k-restricted structure is a simple graph whose blocks are planar and each has at most k vertices. Planar k-restricted structures are used by approximation algorithms for Maximum Weight Planar Subgraph, which motivates this work. The planar k-
Gruia Calinescu, Cristina G. Fernandes
doaj
Area-Efficient Drawings of Outerplanar Graphs [PDF]
, 2004 Ashim Garg, Adrian Rusu
openalex +1 more source
The complexity of frugal colouring. [PDF]
Arab J Math, 2021 Bard S, MacGillivray G, Redlin S.
europepmc +1 more source
Light graphs in families of outerplanar graphs
Discrete Mathematics, 2007 We prove that every 2-connected outerplanar graph of order at least k (k>=3) contains a path on k vertices with all vertices of degree at most k+3 and a path on k vertices with degree sum at most 4k-2. Further, every 2-connected outerplanar graph without adjacent vertices with degree sum =
openaire +2 more sources