X
Search Filters
Format Format
Subjects Subjects
Subjects Subjects
X
Sort by Item Count (A-Z)
Filter by Count
mathematics (161) 161
outerplanar graph (154) 154
outerplanar graphs (135) 135
mathematics, applied (119) 119
graphs (109) 109
algorithms (73) 73
planar graphs (69) 69
computer science (62) 62
outerplanar (43) 43
graph theory (41) 41
combinatorics (39) 39
computer science, theory & methods (38) 38
discrete mathematics and combinatorics (36) 36
planar graph (34) 34
mathematical analysis (32) 32
theoretical computer science (32) 32
trees (31) 31
discrete mathematics (28) 28
chromatic number (26) 26
computer science, information systems (23) 23
number (21) 21
coloring (20) 20
computer science, software engineering (20) 20
theory of computation (19) 19
mathematics - combinatorics (18) 18
maximal outerplanar graph (17) 17
optimization (17) 17
algorithm (15) 15
computational geometry (15) 15
maximal outerplanar graphs (15) 15
planar (15) 15
combinatorial analysis (14) 14
domination (14) 14
tree (14) 14
applied mathematics (13) 13
convex and discrete geometry (13) 13
maximum degree (13) 13
computational theory and mathematics (12) 12
mathematical modeling and industrial mathematics (12) 12
pathwidth (12) 12
polynomials (12) 12
computer science, hardware & architecture (11) 11
computer science, interdisciplinary applications (11) 11
game chromatic number (11) 11
series-parallel graph (11) 11
sets (11) 11
treewidth (11) 11
triangulation (11) 11
upper bounds (11) 11
05c15 (10) 10
apexes (10) 10
halin graph (10) 10
operations research/decision theory (10) 10
05c10 (9) 9
[ info.info-dm ] computer science [cs]/discrete mathematics [cs.dm] (9) 9
complexity (9) 9
computational mathematics and numerical analysis (9) 9
engineering design (9) 9
graph (9) 9
graph algorithms (9) 9
graph drawing (9) 9
integers (9) 9
minor-free graph (9) 9
networks (9) 9
acyclic edge coloring (8) 8
algorithm analysis and problem complexity (8) 8
color (8) 8
colorings (8) 8
decomposition (8) 8
drawing (8) 8
girth (8) 8
isomorphism (8) 8
mathematical models (8) 8
studies (8) 8
analysis (7) 7
approximation algorithms (7) 7
computer science - discrete mathematics (7) 7
diameter (7) 7
domination number (7) 7
geometry (7) 7
graph coloring (7) 7
graph mining (7) 7
index (7) 7
mathematics, general (7) 7
np-completeness (7) 7
planes (7) 7
total domination (7) 7
width (7) 7
approximation algorithm (6) 6
bipartite graph (6) 6
computation (6) 6
crossing number (6) 6
drawings (6) 6
edge (6) 6
enumeration (6) 6
forests (6) 6
geometry and topology (6) 6
k-outerplanar graphs (6) 6
l-labeling (6) 6
mathematics of computing (6) 6
more...
Language Language
Publication Date Publication Date
Click on a bar to filter by decade
Slide to change publication date range


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
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
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
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
Journal Article
Applied Mathematics and Computation, ISSN 0096-3003, 02/2019, Volume 343, pp. 90 - 99
Let G be a graph of order n with adjacency matrix A(G) and let D(G) be the diagonal matrix of the degrees of G. For any real α ∈ [0, 1], write Aα(G) for the... 
Convex combination of matrices | α-index | Outerplanar graph | Planar graph | Spectral extremal problem | MATHEMATICS, APPLIED | alpha-index
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
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
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
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
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... 
[formula omitted]-minor free graph | Triangulation | Outerplanar graph | Domination number
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
Journal Article
Journal of the Indian Mathematical Society, ISSN 0019-5839, 07/2014, Volume 81, Issue 3-4, pp. 309 - 318
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
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
Journal Article
Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), ISSN 0302-9743, 2012, Volume 7434, pp. 157 - 168
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
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
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
Journal Article
Journal of Combinatorial Optimization, ISSN 1382-6905, 10/2019, Volume 38, Issue 3, pp. 911 - 926
Journal Article
No results were found for your search.

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