Results 111 to 120 of about 5,384 (188)
A Note on the Fair Domination Number in Outerplanar Graphs
Discussiones Mathematicae Graph Theory, 2020 For k ≥ 1, a k-fair dominating set (or just kFD-set), in a graph G is a dominating set S such that |N(v) ∩ S| = k for every vertex v ∈ V − S. The k-fair domination number of G, denoted by fdk(G), is the minimum cardinality of a kFD-set. A fair dominating
Hajian Majid, Rad Nader Jafari
doaj +1 more source
Vertex Colorings without Rainbow Subgraphs
Discussiones Mathematicae Graph Theory, 2016 Given a coloring of the vertices of a graph G, we say a subgraph is rainbow if its vertices receive distinct colors. For a graph F, we define the F-upper chromatic number of G as the maximum number of colors that can be used to color the vertices of G ...
Goddard Wayne, Xu Honghai
doaj +1 more source
The edge chromatic number of outer-1-planar graphs [PDF]
, 2014 A graph is outer-1-planar if it can be drawn in the plane so that all vertices are on the outer face and each edge is crossed at most once.
Zhang, Xin
core
(2,1)-Total labelling of outerplanar graphs
Discrete Applied Mathematics, 2007 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Chen, Dong, Wang, Weifan
openaire +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
Convex-Arc Drawings of Pseudolines [PDF]
, 2016 A weak pseudoline arrangement is a topological generalization of a line arrangement, consisting of curves topologically equivalent to lines that cross each other at most once.
Eppstein, David +3 more
core +1 more source
, 2022 Treballs Finals de Grau de Matemàtiques, Facultat de Matemàtiques, Universitat de Barcelona, Any: 2022, Director: Kolja ...
openaire +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
Special Issue Dedicated to the 16th International Symposium on Parameterized and Exact Computation. [PDF]
Algorithmica, 2022 Golovach PA, Zehavi M.
europepmc +1 more source
Non-Preemptive Tree Packing. [PDF]
Algorithmica, 2023 Lendl S, Woeginger G, Wulf L.
europepmc +1 more source