Results 11 to 20 of about 294 (70)
On characterizing proper max-point-tolerance graphs
AKCE International Journal of Graphs and Combinatorics, 2023 Max-point-tolerance graphs (MPTG) were introduced by Catanzaro et al. in 2017 as a generalization of interval graphs. This graph class has many practical applications in the study of the human genome as well as in signal processing for networks. The same
Sanchita Paul
doaj +1 more source
Annular and pants thrackles [PDF]
Discrete Mathematics & Theoretical Computer Science, 2018 A thrackle is a drawing of a graph in which each pair of edges meets precisely once. Conway's Thrackle Conjecture asserts that a thrackle drawing of a graph on the plane cannot have more edges than vertices.
Grace Misereh, Yuri Nikolayevsky
doaj +1 more source
On the pseudolinear crossing number [PDF]
, 2014 A drawing of a graph is {\em pseudolinear} if there is a pseudoline arrangement such that each pseudoline contains exactly one edge of the drawing. The {\em pseudolinear crossing number} of a graph $G$ is the minimum number of pairwise crossings of edges
Hernandez-Velez, Cesar +2 more
core +1 more source
Coloring Sums of Extensions of Certain Graphs [PDF]
, 2016 Recall that the minimum number of colors that allow a proper coloring of graph $G$ is called the chromatic number of $G$ and denoted by $\chi(G).$ In this paper the concepts of $\chi$'-chromatic sum and $\chi^+$-chromatic sum are introduced. The extended
Bej, Saptarshi, Kok, Johan
core +4 more sources
Old and new generalizations of line graphs
International Journal of Mathematics and Mathematical Sciences, Volume 2004, Issue 29, Page 1509-1521, 2004., 2004 Line graphs have been studied for over seventy years. In 1932, H. Whitney showed that for connected graphs, edge‐isomorphism implies isomorphism except for K3 and K1,3. The line graph transformation is one of the most widely studied of all graph transformations.
Jay Bagga
wiley +1 more source
Homomorphic Preimages of Geometric Paths
Discussiones Mathematicae Graph Theory, 2018 A graph G is a homomorphic preimage of another graph H, or equivalently G is H-colorable, if there exists a graph homomorphism f : G → H. A geometric graph Ḡ is a simple graph G together with a straight line drawing of G in the plane with the vertices in
Cockburn Sally
doaj +1 more source
On edge-sets of bicliques in graphs [PDF]
, 2012 A biclique is a maximal induced complete bipartite subgraph of a graph. We investigate the intersection structure of edge-sets of bicliques in a graph. Specifically, we study the associated edge-biclique hypergraph whose hyperedges are precisely the edge-
Groshaus, Marina +2 more
core +2 more sources
On An Extremal Problem In The Class Of Bipartite 1-Planar Graphs
Discussiones Mathematicae Graph Theory, 2016 A graph G = (V, E) is called 1-planar if it admits a drawing in the plane such that each edge is crossed at most once. In this paper, we study bipartite 1-planar graphs with prescribed numbers of vertices in partite sets.
Czap Július +2 more
doaj +1 more source
NOTE ON THE DIMENSION OF THE MYCIELSKIAN OF A GRAPH
, 2016 The dimension of a graph G is the smallest integer k such that G has a unitdistance representation in Euclidean space R. In this note, we study the relation between the dimensions of a graph and its Mycielskian.
P. Ak, T. Madaras, P. Siroczki
semanticscholar +1 more source
The Crossing Number of The Hexagonal Graph H3,n
Discussiones Mathematicae Graph Theory, 2019 In [C. Thomassen, Tilings of the torus and the Klein bottle and vertex-transitive graphs on a fixed surface, Trans. Amer. Math. Soc. 323 (1991) 605–635], Thomassen described completely all (except finitely many) regular tilings of the torus S1 and the ...
Wang Jing +2 more
doaj +1 more source