Results 131 to 140 of about 1,056 (209)
A study of upper ideal relation graphs of rings
AKCE International Journal of Graphs and CombinatoricsLet 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 +2 more
doaj +1 more source
Maximally Expressive Graph Neural Networks for Outerplanar Graphs
We propose a linear time graph transformation that enables the Weisfeiler-Leman (WL) algorithm and message passing graph neural networks (MPNNs) to be maximally expressive on outerplanar graphs.
Gärtner, Thomas; orcid: +8 more
core
List-colourings of near-outerplanar graphs [PDF]
, 2007 A list-colouring of a graph is an assignment of a colour to each vertex v from its own list L(v) of colours. Instead of colouring vertices we may want to colour other elements of a graph such as edges, faces, or any combination of vertices, edges and ...
Hetherington, TJ +2 more
core
Maximum packing for biconnected outerplanar graphs
, 2000 The problem of determining the maximum number of vertex-disjoint subgraphs of a biconnected outerplanar graph H on nh vertices isomorphic to a “pattern” biconnected outerplanar graph G on ng vertices is shown to be solvable in time O((nhng)2)
Kovacs, Tomas +3 more
core +1 more source
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
The Canadian Traveller Problem on outerplanar graphs
CoRRWe study the $k$-Canadian Traveller Problem, where a weighted graph $G=(V,E,ω)$ with a source $s\in V$ and a target $t\in V$ are given. This problem also has a hidden input $E_* \subsetneq E$ of cardinality at most $k$ representing blocked edges. The objective is to travel from $s$ to $t$ with the minimum distance.
Beaudou, Laurent +7 more
openaire +5 more sources
A 2-Approximation for the Height of Maximal Outerplanar Graph Drawings
, 2016 In this thesis, we study drawings of maximal outerplanar graphs that place vertices on integer coordinates. We introduce a new class of graphs, called umbrellas, and a new method of splitting maximal outerplanar graphs into systems of umbrellas. By doing
Demontigny, Philippe
core
Point deletions of outerplanar blocks
, 1976 Let G be a graph. If v is a vertex of G then the (− 1, v)-subgraphs of G are defined to be the point deletions of G, except for G ∼ {v}, with v labeled on each. This paper first classifies all outerplanar blocks which have a pair of v-isomorphic (− 1, v)-
Giles, William B
core +1 more source
A note on compact and compact circular edge-colorings of graphs
Discrete Mathematics & Theoretical Computer Science, 2008 In the paper we study two variants of edge-coloring of edge-weighted graphs, namely compact edge-coloring and circular compact edge-coloring. First, we discuss relations between these two coloring models.
Dariusz Dereniowski, Adam Nadolski
doaj