Results 11 to 20 of about 274 (48)
Filling cages. Reverse mathematics and combinatorial principles
Bulletin of Symbolic Logic, 2020 prepared by Gianluca Basso. E-mail: gianluca.basso@protonmail.com URL: http://people.unil.ch/gianlucabasso Marta Fiori Carones, Filling cages. Reverse mathematics and combinatorial principles, University of Udine, Italy. 2020.
Marta Fiori Carones
semanticscholar +1 more source
Measurable combinatorics and orbit equivalence relations
Bulletin of Symbolic Logic, 2020 prepared by Gianluca Basso. E-mail: gianluca.basso@protonmail.com URL: http://people.unil.ch/gianlucabasso Marta Fiori Carones, Filling cages. Reverse mathematics and combinatorial principles, University of Udine, Italy. 2020.
Tomasz Cieśla
semanticscholar +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
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
Discussiones Mathematicae Graph Theory, 2017 We characterize the class L32$L_3^2 $ of intersection graphs of hypergraphs with rank at most 3 and multiplicity at most 2 by means of a finite list of forbidden induced subgraphs in the class of threshold graphs.
Metelsky Yury +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
A Note on the Crossing Numbers of 5-Regular Graphs
Discussiones Mathematicae Graph Theory, 2020 The crossing number cr(G) of a graph G is the smallest number of edge crossings in any drawing of G. In this paper, we prove that there exists a unique 5-regular graph G on 10 vertices with cr(G) = 2.
Ouyang Zhangdong
doaj +1 more source
THE SECOND EDGE-WIENER INDEX OF SOME COMPOSITE GRAPHS
, 2014 In this paper we study the behavior of the second edge-Wiener index under the join and corona product of graphs. Results are applied for some classes of graphs such as suspensions, bottlenecks, and thorny graphs.
M. Azari, A. Iranmanesh
semanticscholar +1 more source