Results 71 to 80 of about 31,664 (169)
On the Representation of a PI-Graph
Trends in Computational and Applied Mathematics, 2007 Consider two parallel lines (denoted r1 and r2). A graph is a PI graph (Point-Interval graph) if it is an intersection graph of a family F of triangles between r1 and r2 such that each triangle has an interval with two endpoints on r1 and a vertex (a ...
S.M. Almeida, C.P. de Mello, A. Gomide
doaj +1 more source
Vertex Colorings without Rainbow Subgraphs
Discussiones Mathematicae Graph Theory, 2016 Given a coloring of the vertices of a graph G, we say a subgraph is rainbow if its vertices receive distinct colors. For a graph F, we define the F-upper chromatic number of G as the maximum number of colors that can be used to color the vertices of G ...
Goddard Wayne, Xu Honghai
doaj +1 more source
Triangle-intersecting families of graphs
Journal of the European Mathematical Society, 2012 A family \mathcal F of graphs is triangle-intersecting if for every G,H\in\mathcal F ,
ELLIS, DC, FILMUS, Y, FRIEDGUT, E
openaire +5 more sources
An efficient asymmetric removal lemma and its limitations
Forum of Mathematics, SigmaThe triangle removal states that if G contains $\varepsilon n^2$ edge-disjoint triangles, then G contains $\delta (\varepsilon )n^3$ triangles. Unfortunately, there are no sensible bounds on the order of growth of $\delta (\varepsilon )$
Lior Gishboliner +2 more
doaj +1 more source
Dynkin graphs and triangle singularities [PDF]
Kodai Mathematical Journal, 1994 7 pages, AMS ...
openaire +4 more sources
On the Structure of a Triangle-Free Infinite-Chromatic Graph of Gyarfas
International Journal of Mathematics and Mathematical Sciences, 1983 Gyárfás has recently constructed an elegant new example of a triangle-free infinite graph G with infinite chromatic number. We analyze its structure by studying the properties of a nested family of subgraphs Gn whose union is G.
Larry Eggan, Frank Harary
doaj +1 more source
LiteTE: Lightweight, Communication-Efficient Distributed-Memory Triangle Enumerating
IEEE Access, 2019 Distributed-memory triangle enumerating has attracted considerable interests due to its potential capability to process huge graphs quickly. However, existing algorithms suffer from low speed due to high communication cost and load imbalance.
Yongxuan Zhang +5 more
doaj +1 more source
On line graphs of subcubic triangle-free graphs
Discrete Mathematics, 2017 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
openaire +3 more sources
The triangle graph $T_6$ is not SPN
The Electronic Journal of Linear Algebra, 2020 A real symmetric matrix $A$ is copositive if $x'Ax \geq 0$ for every nonnegative vector $x$. A matrix is SPN if it is a sum of a real positive semidefinite matrix and a nonnegative matrix. Every SPN matrix is copositive, but the converse does not hold for matrices of order greater than $4$.
openaire +3 more sources
Discussiones Mathematicae Graph Theory, 2019 Let G be a connected graph with minimum degree δ and edge-connectivity λ. A graph is maximally edge-connected if λ = δ, and it is super-edgeconnected if every minimum edge-cut is trivial; that is, if every minimum edge-cut consists of edges incident with
Volkmann Lutz
doaj +1 more source