Results 301 to 310 of about 279,078 (329)
Some of the next articles are maybe not open access.
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
The AME 2020 atomic mass evaluation (II). Tables, graphs and references*
Chinese Physics C, 2021Meng Wang, Filip Kondev, Sarah Naimi
exaly
Haplotype-resolved de novo assembly using phased assembly graphs with hifiasm
Nature Methods, 2021Haoyu Cheng +2 more
exaly