Results 101 to 110 of about 3,679 (179)

Odd 4-Coloring of Outerplanar Graphs

open access: yesGraphs 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

Outerplanar Graphs and Delaunay Triangulations [PDF]

open access: yes, 2012
Dillencourt [1] showed that all maximal outerplanar graphs can be realized as Delaunay triangulations of points in convex position. In this note, we give two new, alternate proofs.
Alam, Ashraful   +2 more
openaire   +2 more sources

Non-Preemptive Tree Packing. [PDF]

open access: yesAlgorithmica, 2023
Lendl S, Woeginger G, Wulf L.
europepmc   +1 more source

Edge Roman domination on graphs

open access: yes, 2014
An edge Roman dominating function of a graph $G$ is a function $f\colon E(G) \rightarrow \{0,1,2\}$ satisfying the condition that every edge $e$ with $f(e)=0$ is adjacent to some edge $e'$ with $f(e')=2$.
Chang, Gerard J.   +2 more
core  

On the Relationships between Zero Forcing Numbers and Certain Graph Coverings

open access: yesSpecial 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   +2 more
doaj   +1 more source

The complexity of frugal colouring. [PDF]

open access: yesArab J Math, 2021
Bard S, MacGillivray G, Redlin S.
europepmc   +1 more source

Unsplittable Multicommodity Flows in Outerplanar Graphs

open access: yes
Full version of IPCO 2025 ...
David Alemán-Espinosa, Nikhil Kumar
openaire   +2 more sources

Home - About - Disclaimer - Privacy