Results 71 to 80 of about 842,964 (161)

A note on outerplanarity of product graphs [PDF]

, 1991
Pranava K. Jha, Giora Slutzki
openalex   +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

The complexity of frugal colouring. [PDF]

Arab J Math, 2021
Bard S, MacGillivray G, Redlin S.
europepmc   +1 more source

Area-Efficient Drawings of Outerplanar Graphs [PDF]

, 2004
Ashim Garg, Adrian Rusu
openalex   +1 more source

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

Optimal Acyclic Hamiltonian Path Completion for Outerplanar Triangulated st-Digraphs (with Application to Upward Topological Book Embeddings)

, 2008
Given an embedded planar acyclic digraph G, we define the problem of "acyclic hamiltonian path completion with crossing minimization (Acyclic-HPCCM)" to be the problem of determining an hamiltonian path completion set of edges such that, when these edges
Mchedlidze, Tamara, Symvonis, Antonios
core  

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

Adv Appl Math, 2021
Mansour T, Rastegar R, Roitershtein A.
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

Small Area Drawings of Outerplanar Graphs [PDF]

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

Clustering systems of phylogenetic networks. [PDF]

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