Results 71 to 80 of about 3,724 (174)
Strong Oriented Chromatic Number of Planar Graphs without Short Cycles [PDF]
Discrete Mathematics & Theoretical Computer Science, 2008 Let M be an additive abelian group. An M-strong-oriented coloring of an oriented graph G is a mapping f from V(G) to M such that f(u) j(v) whenever uv is an arc in G and f(v)−f(u) −(f(t)−f(z)) whenever uv and zt are two arcs in G.
Mickael Montassier +2 more
doaj +1 more source
Frequent Subgraph Mining in Outerplanar Graphs [PDF]
, 2010 In recent years there has been an increased interest in frequent pattern discovery in large databases of graph structured objects. While the frequent connected subgraph mining problem for tree datasets can be solved in incremental polynomial time, it ...
Horvath, Tamas +2 more
core +1 more source
On vertex‐transitive graphs with a unique hamiltonian cycle
Journal of Graph Theory, Volume 108, Issue 1, Page 65-99, January 2025.Abstract A graph is said to be uniquely hamiltonian if it has a unique hamiltonian cycle. For a natural extension of this concept to infinite graphs, we find all uniquely hamiltonian vertex‐transitive graphs with finitely many ends, and also discuss some examples with infinitely many ends.
Babak Miraftab, Dave Witte Morris
wiley +1 more source
Discrete Mathematics & Theoretical Computer Science, 2004 A \emph(k,t)-track layout of a graph G consists of a (proper) vertex t-colouring of G, a total order of each vertex colour class, and a (non-proper) edge k-colouring such that between each pair of colour classes no two monochromatic edges cross.
Vida Dujmović +2 more
doaj +3 more sources
On the k-restricted structure ratio in planar and outerplanar graphs [PDF]
Discrete Mathematics & Theoretical Computer Science, 2008 Graphs and ...
Gruia Călinescu, Cristina G. Fernandes
doaj +1 more source
On the Hub Number of Ring Graphs and Their Behavior Under Graph Operations
International Journal of Mathematics and Mathematical Sciences, Volume 2025, Issue 1, 2025.This study examines the hub number of ring graphs and investigates their behavior under operations such as union, intersection, and join. Different findings for this parameter are found for a variety of types of ring graphs, such as commutative ring graphs, path ring graphs, complete ring graphs, cycle ring graphs, and star ring graphs, for which the ...
Mohammed Alsharafi +3 more
wiley +1 more source
A Survey of Maximal k-Degenerate Graphs and k-Trees
Theory and Applications of GraphsThis article surveys results on maximal $k$-degenerate graphs, $k$-trees, and related classes including simple $k$-trees, $k$-paths, maximal outerplanar graphs, and Apollonian networks.
Allan Bickle
doaj +1 more source
Self‐avoiding walks and polygons on hyperbolic graphs
Journal of Graph Theory, Volume 106, Issue 3, Page 435-473, July 2024.Abstract We prove that for the d $d$‐regular tessellations of the hyperbolic plane by k $k$‐gons, there are exponentially more self‐avoiding walks of length n $n$ than there are self‐avoiding polygons of length n $n$. We then prove that this property implies that the self‐avoiding walk is ballistic, even on an arbitrary vertex‐transitive graph ...
Christoforos Panagiotis
wiley +1 more source
Small Superpatterns for Dominance Drawing
, 2013 We exploit the connection between dominance drawings of directed acyclic graphs and permutations, in both directions, to provide improved bounds on the size of universal point sets for certain types of dominance drawing and on superpatterns for certain ...
Bannister, Michael J. +2 more
core +1 more source
Random graphs embeddable in order‐dependent surfaces
Random Structures &Algorithms, Volume 64, Issue 4, Page 940-985, July 2024.Abstract Given a ‘genus function’ g=g(n)$$ g=g(n) $$, we let Eg$$ {\mathcal{E}}^g $$ be the class of all graphs G$$ G $$ such that if G$$ G $$ has order n$$ n $$ (i.e., has n$$ n $$ vertices) then it is embeddable in a surface of Euler genus at most g(n)$$ g(n) $$.
Colin McDiarmid, Sophia Saller
wiley +1 more source