Results 111 to 120 of about 1,769 (162)
Induced cycle structure and outerplanarity
Discrete Mathematics, 2000 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
openaire +2 more sources
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
Location in maximal outerplanar graphs
In this work we study the metric dimension and the location-domination number of maximal outerplanar graphs. Concretely, we determine tight upper and lower bounds on the metric dimension and characterize those maximal outerplanar graphs attaining the ...
Hernando Martín, María del Carmen +6 more
core
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
Rainbow subgraphs in edge-colored planar and outerplanar graphs [PDF]
Discrete Mathematics Letters, 2023 Július Czap
doaj +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
Oriented coloring of 2-outerplanar graphs
, 2007 A graph G is 2-outerplanar if it has a planar embedding such that the subgraph obtained by removing the vertices of the outer face is outerplanar. The oriented chromatic number of an oriented graph H is defined as the minimum order of an oriented graph H'
Esperet, Louis, Ochem, Pascal
core
ABSTRACT FOG: Finding Outerplanar Graphs
, 2008 In this demo we will present FOG, a system that mines frequent outerplanar graphs. We argue that outerplanar graphs are an interesting class as they can be mined efficiently and are practically relevant for chemical applications.
Jan Ramon
core
Choosability with separation of cycles and outerplanar graphs
Discussiones Mathematicae Graph Theory, 2023 Jean-Christophe Godin, Oliver Togni
doaj +1 more source
Parallel O(log(n)) time edge-colouring of trees and Halin graphs [PDF]
We present parallel O(log(n))-time algorithms for optimal edge colouring of trees and Halin graphs with n processors on a a parallel random access machine without write conflicts (P-RAM).
Gibbons, Alan (Alan M.) +2 more
core