Results 131 to 140 of about 414,139 (194)
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
Structure Properties of Generalized Farey graphs based on Dynamical Systems for Networks. [PDF]
Sci Rep, 2018 Jiang W, Zhai Y, Martin P, Zhao Z.
europepmc +1 more source
On packing chromatic number of subcubic outerplanar graphs
, 2018 Although it has recently been proved that the packing chromatic number is unbounded on the class of subcubic graphs, there exists subclasses in which the packing chromatic number is finite (and small).
Holub, Přemysl +2 more
core
Star coloring of outerplanar bipartite graphs
, 2014 In this thesis, we investigate a coloring problem on a special class of graphs. A proper coloring of a graph is a coloring of the vertices of the graph so that vertices joined by an edge get different colors.
Sanders, Gina
core
Comparison and enumeration of chemical graphs. [PDF]
Comput Struct Biotechnol J, 2013 Akutsu T, Nagamochi H.
europepmc +1 more source
The Scaling Limit of Random Two-Connected Series-Parallel Maps. [PDF]
J Theor ProbabAmankwah D +4 more
europepmc +1 more source
Finding Cactus Roots in Polynomial Time. [PDF]
Theory Comput Syst, 2018 Golovach PA +3 more
europepmc +1 more source
Straight Skeletons and Mitered Offsets of Nonconvex Polytopes. [PDF]
Discrete Comput Geom, 2016 Aurenhammer F, Walzl G.
europepmc +1 more source
Twisted Ways to Find Plane Structures in Simple Drawings of Complete Graphs. [PDF]
Discrete Comput GeomAichholzer O +4 more
europepmc +1 more source