Results 121 to 130 of about 4,003 (201)

L(2, 1)-Labelings of Some Families of Oriented Planar Graphs

Discussiones Mathematicae Graph Theory, 2014
In this paper we determine, or give lower and upper bounds on, the 2-dipath and oriented L(2, 1)-span of the family of planar graphs, planar graphs with girth 5, 11, 16, partial k-trees, outerplanar graphs and cacti.
Sen Sagnik
doaj   +1 more source

Small Area Drawings of Outerplanar Graphs [PDF]

, 2006
Giuseppe Di Battista, Fabrizio Frati
openalex   +1 more source

Horizontal visibility graph of a random restricted growth sequence. [PDF]

Adv Appl Math, 2021
Mansour T, Rastegar R, Roitershtein A.
europepmc   +1 more source

Chromatic Sums for Colorings Avoiding Monochromatic Subgraphs

Discussiones Mathematicae Graph Theory, 2015
Given graphs G and H, a vertex coloring c : V (G) →ℕ is an H-free coloring of G if no color class contains a subgraph isomorphic to H. The H-free chromatic number of G, χ (H,G), is the minimum number of colors in an H-free coloring of G.
Kubicka Ewa, Kubicki Grzegorz, McKeon Kathleen A.   +2 more
doaj   +1 more source

k-Colored Point-Set Embeddability of Outerplanar Graphs [PDF]

, 2007
Emilio Di Giacomo, Walter Didimo, Giuseppe Liotta, Henk Meijer, Francesco Trotta, Stephen Wismath   +5 more
openalex   +1 more source

Algebraic characterizations of outerplanar and planar graphs

European Journal of Combinatorics, 2007
AbstractA drawing of a graph in the plane is even if nonadjacent edges have an even number of intersections. Hanani’s theorem characterizes planar graphs as those graphs that have an even drawing. In this paper we present an algebraic characterization of graphs that have an even drawing.
openaire   +3 more sources

Clustering systems of phylogenetic networks. [PDF]

Theory Biosci, 2023
Hellmuth M, Schaller D, Stadler PF.
europepmc   +1 more source

A study of upper ideal relation graphs of rings

AKCE International Journal of Graphs and Combinatorics
Let R be a ring with unity. The upper ideal relation graph [Formula: see text] of the ring R is the simple undirected graph whose vertex set is the set of all non-unit elements of R and two distinct vertices x, y are adjacent if and only if there exists ...
Barkha Baloda, Praveen Mathil, Jitender Kumar   +2 more
doaj   +1 more source

Constant Approximation Algorithms for Embedding Graph Metrics into Trees and Outerplanar Graphs [PDF]

, 2011
Victor Chepoi, Feodor F. Dragan, Ilan Newman, Yuri Rabinovich, Yann Vaxès   +4 more
openalex   +1 more source

The Tutte polynomial characterizes simple outerplanar graphs [PDF]

, 2011
Andrew Goodall, Anna de Mier, Steven D. Noble, Marc Noy   +3 more
openalex   +1 more source