Results 151 to 160 of about 278,889 (179)
Some of the next articles are maybe not open access.
On highly ramsey infinite graphs
Journal of Graph Theory, 2008AbstractWe show that, for r ≥ 2 and k ≥ 3, there exists a positive constant c such that for large enough n there are 2 non‐isomorphic graphs on at most n vertices that are r‐ramsey‐minimal for the odd cycle C2k+1. © 2008 Wiley Periodicals, Inc.
openaire +2 more sources
Nevanlinna Theory on Infinite Graphs
Computational Methods and Function TheoryzbMATH Open Web Interface contents unavailable due to conflicting licenses.
Atsuji, Atsushi, Kaneko, Hiroshi
openaire +1 more source
1990
Given a graph \(G\), a covering of \(G\) is a set of subgraphs \(\{G_ 1,G_ 2,\dots,G_ k\}\) such that every edge of \(G\) is in some \(G_ i\). A set of edges \(\{e_ 1,e_ 2,\dots,e_ k\}\) with \(e_ i\in E(G_ i)\) is called a set of distinct representing edges. \textit{L.
openaire +2 more sources
Given a graph \(G\), a covering of \(G\) is a set of subgraphs \(\{G_ 1,G_ 2,\dots,G_ k\}\) such that every edge of \(G\) is in some \(G_ i\). A set of edges \(\{e_ 1,e_ 2,\dots,e_ k\}\) with \(e_ i\in E(G_ i)\) is called a set of distinct representing edges. \textit{L.
openaire +2 more sources
How many equivalence classes of geodesic rays does a graph contain? How many bounded automorphisms does a planar graph have? Neimayer and Watkins studied these two questions and answered them for a certain class of graphs. Using the concept of excess of a vertex, the class of graphs that Neimayer and Watkins studied are extended to include graphs with ...
openaire +1 more source
openaire +1 more source
Distinct Classes of Complex Structural Variation Uncovered across Thousands of Cancer Genome Graphs
Cell, 2020Kevin Hadi +2 more
exaly