Results 101 to 110 of about 3,901 (159)

DEFICIENCY OF OUTERPLANAR GRAPHS

Proceedings of the YSU A: Physical and Mathematical Sciences, 2017
An edge-coloring of a graph G with colors $1,2,...,t$ is an interval $t$-coloring, if all colors are used, and the colors of edges incident to each vertex of $G$ are distinct and form an interval of integers. A graph $G$ is interval colorable, if it has an interval $t$-coloring for some positive integer $t$.
openaire   +1 more source

Planar linear arrangements of outerplanar graphs

IEEE Transactions on Circuits and Systems, 1988
Given an n-vertex outerplanar graph G, we consider the problem of arranging the vertices of G on a line such that no two edges cross and various cost measures are minimized. We present efficient algorithms for generating layouts in which every edge (i,j) of G does not exceed a given bandwidth b(i,j), the total edge length and the cutwidth of the layout
Frederickson, Greg N., Hambrusch, Susanne E.   +1 more
openaire   +3 more sources

Mitochondrial networks through the lens of mathematics. [PDF]

Phys Biol, 2023
Lewis GR, Marshall WF.
europepmc   +1 more source

Rainbow subgraphs in edge-colored planar and outerplanar graphs [PDF]

Discrete Mathematics Letters, 2023
Július Czap
doaj   +1 more source

On the Relationships between Zero Forcing Numbers and Certain Graph Coverings

Special Matrices, 2014
The zero forcing number and the positive zero forcing number of a graph are two graph parameters that arise from two types of graph colourings. The zero forcing number is an upper bound on the minimum number of induced paths in the graph that cover all ...
Taklimi Fatemeh Alinaghipour, Fallat Shaun, Meagher Karen   +2 more
doaj   +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

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

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

Characterizations of outerplanar graphs

Discrete Mathematics, 1979
AbstractThe paper presents several characterizations of outerplanar graphs, some of them are counterparts of the well-known characterizations of planar graphs and the other provide very efficient tools for outerplanarity testing, coding (i.e. isomorphism testing), and counting such graphs.
openaire   +1 more source

Odd 4-Coloring of Outerplanar Graphs

Graphs and Combinatorics
A proper $k$-coloring of $G$ is called an odd coloring of $G$ if for every vertex $v$, there is a color that appears at an odd number of neighbors of $v$. This concept was introduced recently by Petruševski and Škrekovski, and they conjectured that every planar graph is odd 5-colorable.
Kashima, Masaki, Zhu, Xuding
openaire   +2 more sources