Results 21 to 30 of about 34,901 (303)
The recognition of triangle graphs [PDF]
Theoretical Computer Science, 2012 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
openaire +5 more sources
On triangle cover contact graphs [PDF]
Computational Geometry, 2015 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Shaheena Sultana +4 more
openaire +1 more source
The fractional chromatic number of triangle-free subcubic graphs [PDF]
, 2014 Heckman and Thomas conjectured that the fractional chromatic number of any triangle-free subcubic graph is at most 14 / 5. Improving on estimates of Hatami and Zhu and of Lu and Peng, we prove that the fractional chromatic number of any triangle-free ...
Král’, Daniel +5 more
core +1 more source
On vertex and edge degree-based topological indices
Vojnotehnički Glasnik, 2023 Introduction/purpose: The entire topological indices (T Ient) are a class of graph invariants depending on the degrees of vertices and edges. Some general properties of these invariants are established.
Ivan Gutman
doaj +1 more source
Discrete Analysis, 2020 An efficient container lemma, Discrete Analysis 2020:17, 56 pp. The hypergraph container lemma, discovered independently in 2012 by David Saxton and Andrew Thomason, and by József Balogh, Robert Morris and Wojciech Samotij, is an extremely powerful tool
Jozsef Balogh, Wojciech Samotij
doaj +1 more source
On Touching Triangle Graphs [PDF]
, 2011 In this paper, we consider the problem of representing graphs by triangles whose sides touch. As a simple necessary condition, we show that pairs of vertices must have a small common neighborhood. On the positive side, we present linear time algorithms for creating touching triangle representations for outerplanar graphs, square grid graphs, and ...
Emden R. Gansner +2 more
openaire +2 more sources
Universality of Graphs with Few Triangles and Anti-Triangles [PDF]
Combinatorics, Probability and Computing, 2015 We study 3-random-likegraphs, that is, sequences of graphs in which the densities of triangles and anti-triangles converge to 1/8. Since the random graph$\mathcal{G}$n,1/2is, in particular, 3-random-like, this can be viewed as a weak version of quasi-randomness.
Dan Hefetz, Mykhaylo Tyomkyn
openaire +3 more sources
On the number of pentagons in triangle-free graphs [PDF]
, 2013 Using the formalism of flag algebras, we prove that every triangle-free graph G with n vertices contains at most (n/5)(5) cycles of length five. Moreover, the equality is attained only when n is divisible by five and G is the balanced blow-up of the ...
Hatami, Hamed +4 more
core +1 more source
COMICS: a community property-based triangle motif clustering scheme [PDF]
PeerJ Computer Science, 2019 With the development of science and technology, network scales of various fields have experienced an amazing growth. Networks in the fields of biology, economics and society contain rich hidden information of human beings in the form of connectivity ...
Yufan Feng +4 more
doaj +2 more sources
A second look at counting triangles in graph streams [PDF]
, 2014 In this paper we present improved results on the problem of counting triangles in edge streamed graphs. For graphs with m edges and at least T triangles, we show that an extra look over the stream yields a two-pass streaming algorithm that uses O((m)/(ε4.
Jowhari, Hossein, Cormode, Graham
core +1 more source