Algorithmica, ISSN 0178-4617, 4/2016, Volume 74, Issue 4, pp. 1293 - 1320

A graph is outer 1-planar (o1p) if it can be drawn in the plane such that all vertices are in the outer face and each edge is crossed at most once. o1p graphs...

Computer Systems Organization and Communication Networks | Data Structures, Cryptology and Information Theory | Algorithms | Graph parameters | Mathematics of Computing | Embeddings and drawings | Planar and outerplanar graphs | 1-Planarity | Computer Science | Theory of Computation | Algorithm Analysis and Problem Complexity | Density | COMPUTER SCIENCE, SOFTWARE ENGINEERING | CROSSING NUMBER | MATHEMATICS, APPLIED | EVERY PLANAR MAP | RECTILINEAR DRAWINGS | HARD | ALGORITHMS

Computer Systems Organization and Communication Networks | Data Structures, Cryptology and Information Theory | Algorithms | Graph parameters | Mathematics of Computing | Embeddings and drawings | Planar and outerplanar graphs | 1-Planarity | Computer Science | Theory of Computation | Algorithm Analysis and Problem Complexity | Density | COMPUTER SCIENCE, SOFTWARE ENGINEERING | CROSSING NUMBER | MATHEMATICS, APPLIED | EVERY PLANAR MAP | RECTILINEAR DRAWINGS | HARD | ALGORITHMS

Journal Article

Discrete Applied Mathematics, ISSN 0166-218X, 01/2017, Volume 216, pp. 84 - 97

A graph G is a max point-tolerance (MPT) graph if each vertex v of G can be mapped to a pointed-interval(Iv,pv) where Iv is an interval of R and pv∈Iv such...

Interval graphs | Coloring | Outerplanar graphs | Weighted independent set | Rectangle intersection graphs | Clique cover | Tolerance graphs | L-graphs | INTERSECTION GRAPHS | MATHEMATICS, APPLIED | RECOGNITION | ALGORITHMS | HETEROZYGOSITY | RECTANGLES | PLANE | DOMINATION | Genomics | Analysis

Interval graphs | Coloring | Outerplanar graphs | Weighted independent set | Rectangle intersection graphs | Clique cover | Tolerance graphs | L-graphs | INTERSECTION GRAPHS | MATHEMATICS, APPLIED | RECOGNITION | ALGORITHMS | HETEROZYGOSITY | RECTANGLES | PLANE | DOMINATION | Genomics | Analysis

Journal Article

Discrete Applied Mathematics, ISSN 0166-218X, 10/2015, Volume 194, pp. 147 - 153

It is well known that a graph is outerplanar if and only if it is K4 -minor free and K2 ,3 -minor free. Campos and Wakabayashi (2013) recently proved that...

Triangulation | K 4 -minor free graph | Outerplanar graph | K 2 , 3 -minor free graph | Domination number

Triangulation | K 4 -minor free graph | Outerplanar graph | K 2 , 3 -minor free graph | Domination number

Journal Article

Discrete Applied Mathematics, ISSN 0166-218X, 02/2019, Volume 255, pp. 86 - 97

In this paper, we study the achromatic and the pseudoachromatic numbers of planar and outerplanar graphs as well as planar graphs of girth 4 and graphs...

Thickness | Graphs embeddings | Outerplanar graphs | Pseudoachromatic number | Girth-thickness | Achromatic number | Outerthickness | MATHEMATICS, APPLIED | PSEUDOACHROMATIC INDEX | Lower bounds | Graphs | Mathematics - Combinatorics

Thickness | Graphs embeddings | Outerplanar graphs | Pseudoachromatic number | Girth-thickness | Achromatic number | Outerthickness | MATHEMATICS, APPLIED | PSEUDOACHROMATIC INDEX | Lower bounds | Graphs | Mathematics - Combinatorics

Journal Article

Algorithmica, ISSN 0178-4617, 7/2019, Volume 81, Issue 7, pp. 2795 - 2828

Deciding if a graph has a square root is a classical problem, which has been studied extensively both from graph-theoretic and algorithmic perspective. As the...

Computer Systems Organization and Communication Networks | Outerplanar graphs | Algorithms | Graphs of pathwidth 2 | Mathematics of Computing | Computer Science | Graph square root | Theory of Computation | Algorithm Analysis and Problem Complexity | Data Structures and Information Theory | Computer science

Computer Systems Organization and Communication Networks | Outerplanar graphs | Algorithms | Graphs of pathwidth 2 | Mathematics of Computing | Computer Science | Graph square root | Theory of Computation | Algorithm Analysis and Problem Complexity | Data Structures and Information Theory | Computer science

Journal Article

Discrete Applied Mathematics, ISSN 0166-218X, 08/2019, Volume 267, pp. 215 - 218

A subset S of vertices in a graph G is called an isolating set if V(G)∖NG[S] is an independent set of G. The isolation number ι(G) is the minimum cardinality...

Isolation number | Maximal outerplanar graphs | Partial-domination | MATHEMATICS, APPLIED | TOTAL DOMINATION | SETS | Apexes | Graph theory

Isolation number | Maximal outerplanar graphs | Partial-domination | MATHEMATICS, APPLIED | TOTAL DOMINATION | SETS | Apexes | Graph theory

Journal Article

Discrete Applied Mathematics, ISSN 0166-218X, 08/2019, Volume 266, pp. 163 - 170

The periphery Per(G) of a graph G is the set of vertices of maximum eccentricity. A vertex v belongs to the contour Ct(G) of G if no neighbor of v has an...

Extreme vertices | Eccentricity | Graph boundary | Outerplanar graph | Contour | Periphery | MATHEMATICS, APPLIED | GEODETICITY | Apexes | Graphs | Trees (mathematics) | Graph theory | Inclusions | Sharpness

Extreme vertices | Eccentricity | Graph boundary | Outerplanar graph | Contour | Periphery | MATHEMATICS, APPLIED | GEODETICITY | Apexes | Graphs | Trees (mathematics) | Graph theory | Inclusions | Sharpness

Journal Article

Discrete Applied Mathematics, ISSN 0166-218X, 07/2019, Volume 265, pp. 142 - 157

In this paper, we study the concept of convex domination in maximal outerplanar graphs. For this class of graphs, we discuss several properties of this...

Outerplanar | Convex guard set | Flipping edge | Convex domination | MATHEMATICS, APPLIED | NUMBERS | FLIP DISTANCE | TRIANGULATIONS | MONADIC 2ND-ORDER LOGIC | ALGORITHMS | Algorithms | Upper bounds | Graphs

Outerplanar | Convex guard set | Flipping edge | Convex domination | MATHEMATICS, APPLIED | NUMBERS | FLIP DISTANCE | TRIANGULATIONS | MONADIC 2ND-ORDER LOGIC | ALGORITHMS | Algorithms | Upper bounds | Graphs

Journal Article

Computational Geometry: Theory and Applications, ISSN 0925-7721, 06/2018, Volume 69, pp. 31 - 38

Let S={p ,p ,…,p } be a set of pairwise disjoint geometric objects of some type in a 2D plane and let C={c ,c ,…,c } be a set of closed objects of some type in...

Outerplanar graphs | Triangle cover contact graphs | Cover contact graphs | MATHEMATICS | MATHEMATICS, APPLIED | Computer science | Visualization (Computers) | Algorithms

Outerplanar graphs | Triangle cover contact graphs | Cover contact graphs | MATHEMATICS | MATHEMATICS, APPLIED | Computer science | Visualization (Computers) | Algorithms

Journal Article

Discrete Applied Mathematics, ISSN 0166-218X, 10/2018, Volume 248, pp. 33 - 45

A graph G is said to be 1-perfectly orientable if it has an orientation D such that for every vertex v∈V(G), the out-neighborhood of v in D is a clique in G....

1-perfectly orientable graph | Outerplanar graph | [formula omitted]-minor-free graph | minor-free graph | MINORS | INTERSECTION GRAPHS | MATHEMATICS, APPLIED | SETS | K-4-minor-free graph | SUBTREES

1-perfectly orientable graph | Outerplanar graph | [formula omitted]-minor-free graph | minor-free graph | MINORS | INTERSECTION GRAPHS | MATHEMATICS, APPLIED | SETS | K-4-minor-free graph | SUBTREES

Journal Article

Applied Mathematics and Computation, ISSN 0096-3003, 11/2019, Volume 360, pp. 213 - 220

In 2008, Chartrand et al. first introduced the concept of rainbow connection. Since then the study of rainbow connection has received considerable attention in...

Total rainbow connection number | Thorn graph | Outerplanar graph | Rainbow 2-connection number | Diameter | Information science | Statistics

Total rainbow connection number | Thorn graph | Outerplanar graph | Rainbow 2-connection number | Diameter | Information science | Statistics

Journal Article

Discrete Mathematics, ISSN 0012-365X, 06/2018, Volume 341, Issue 6, pp. 1688 - 1695

We prove new upper bounds for the thickness and outerthickness of a graph in terms of its orientable and nonorientable genus by applying the method of deleting...

Decomposition | Outerplanar graph | Planar graph | Surface | MATHEMATICS

Decomposition | Outerplanar graph | Planar graph | Surface | MATHEMATICS

Journal Article

Discrete Applied Mathematics, ISSN 0166-218X, 01/2017, Volume 217, pp. 506 - 511

We show that the total domination number of a maximal outerplanar graph G is bounded above by n+k3, where n is the order of G and k is the number of vertices...

Domination | Outerplanar graph | Total domination | PLANAR GRAPHS | MATHEMATICS, APPLIED | SETS

Domination | Outerplanar graph | Total domination | PLANAR GRAPHS | MATHEMATICS, APPLIED | SETS

Journal Article

Discrete Mathematics, ISSN 0012-365X, 03/2016, Volume 339, Issue 3, pp. 1180 - 1188

The total domination number of a graph is the minimum size of a set S such that every vertex has a neighbor in S. We show that a maximal outerplanar graph of...

Domination | Outerplanar graph | Total domination | MATHEMATICS | THEOREM | SETS | PLANAR GRAPHS

Domination | Outerplanar graph | Total domination | MATHEMATICS | THEOREM | SETS | PLANAR GRAPHS

Journal Article

Journal of Computer and System Sciences, ISSN 0022-0000, 02/2017, Volume 83, Issue 1, pp. 132 - 158

•In Metric Dimension, we distinguish all pairs of vertices by few selected landmarks.•We show that Metric Dimension is NP-complete on planar graphs.•We show...

Outerplanar graph | Metric dimension | Planar graph | NP-completeness | Computer science | Algorithms | Informàtica | Àrees temàtiques de la UPC | Automàtica i control

Outerplanar graph | Metric dimension | Planar graph | NP-completeness | Computer science | Algorithms | Informàtica | Àrees temàtiques de la UPC | Automàtica i control

Journal Article

Journal of Combinatorial Optimization, ISSN 1382-6905, 10/2019, Volume 38, Issue 3, pp. 911 - 926

A subset S of vertices in a graph G is a dominating set if every vertex in $$V(G) {\setminus } S$$ V ( G ) \ S is adjacent to a vertex in S. If the graph G has...

Paired-domination | Convex and Discrete Geometry | Operations Research/Decision Theory | Semipaired domination number | Maximal outerplanar graphs | Mathematics | Theory of Computation | Mathematical Modeling and Industrial Mathematics | Combinatorics | 05C69 | Optimization | MATHEMATICS, APPLIED | COMPUTER SCIENCE, INTERDISCIPLINARY APPLICATIONS | SEMITOTAL DOMINATION | SETS

Paired-domination | Convex and Discrete Geometry | Operations Research/Decision Theory | Semipaired domination number | Maximal outerplanar graphs | Mathematics | Theory of Computation | Mathematical Modeling and Industrial Mathematics | Combinatorics | 05C69 | Optimization | MATHEMATICS, APPLIED | COMPUTER SCIENCE, INTERDISCIPLINARY APPLICATIONS | SEMITOTAL DOMINATION | SETS

Journal Article

Theoretical Computer Science, ISSN 0304-3975, 05/2019, Volume 770, pp. 88 - 94

We show that any outerplanar graph admits a planar straight-line drawing such that the length ratio of the longest to the shortest edges is strictly less than...

Graph drawing | Outerplanar graphs | Edge-length ratio | COMPUTER SCIENCE, THEORY & METHODS | Computer science | Computer Science | Computational Geometry

Graph drawing | Outerplanar graphs | Edge-length ratio | COMPUTER SCIENCE, THEORY & METHODS | Computer science | Computer Science | Computational Geometry

Journal Article

Discussiones Mathematicae Graph Theory, ISSN 1234-3099, 2019, Volume 39, Issue 4, pp. 899 - 908

A proper coloring of the vertices of a graph is called a star coloring if at least three colors are used on every 4-vertex path. We show that all outerplanar...

outerplanar bipartite graph | chromatic number | star coloring | 05C15

outerplanar bipartite graph | chromatic number | star coloring | 05C15

Journal Article

Taiwanese Journal of Mathematics, ISSN 1027-5487, 12/2018, Volume 22, Issue 6, pp. 1309 - 1320

An injective coloring of a graph is a vertex coloring where two vertices with common neighbor receive distinct colors. The minimum integer 𝑘 such that 𝐺 has...

Injective chromatic number | Outerplanar graph | Injective coloring | COLORINGS | MATHEMATICS | injective chromatic number | PLANAR GRAPHS | injective coloring | outerplanar graph | GIRTH 6

Injective chromatic number | Outerplanar graph | Injective coloring | COLORINGS | MATHEMATICS | injective chromatic number | PLANAR GRAPHS | injective coloring | outerplanar graph | GIRTH 6

Journal Article

Journal of Combinatorial Optimization, ISSN 1382-6905, 1/2017, Volume 33, Issue 1, pp. 317 - 325

A k-(p, 1)-total labelling of a graph G is a function f from $$V(G)\cup E(G)$$ V ( G ) ∪ E ( G ) to the color set $$\{0, 1, \ldots , k\}$$ { 0 , 1 , … , k }...

( p , 1)-total labelling | Minimal counterexample | Convex and Discrete Geometry | Mathematics | Theory of Computation | Mathematical Modeling and Industrial Mathematics | Operation Research/Decision Theory | Discharging method | Combinatorics | Optimization | 05C15 | (p, 1)-total labelling | MATHEMATICS, APPLIED | DISTANCE-2 | NUMBER | COMPUTER SCIENCE, INTERDISCIPLINARY APPLICATIONS | MAXIMUM DEGREE | TOTAL COLORINGS | OUTERPLANAR GRAPHS

( p , 1)-total labelling | Minimal counterexample | Convex and Discrete Geometry | Mathematics | Theory of Computation | Mathematical Modeling and Industrial Mathematics | Operation Research/Decision Theory | Discharging method | Combinatorics | Optimization | 05C15 | (p, 1)-total labelling | MATHEMATICS, APPLIED | DISTANCE-2 | NUMBER | COMPUTER SCIENCE, INTERDISCIPLINARY APPLICATIONS | MAXIMUM DEGREE | TOTAL COLORINGS | OUTERPLANAR GRAPHS

Journal Article

No results were found for your search.

Cannot display more than 1000 results, please narrow the terms of your search.