On a theorem of Kontsevich.
Conant, James, Vogtmann, Karen (2003)
Algebraic & Geometric Topology
Similarity:
Displaying similar documents to “Morita classes in the homology of automorphism groups of free groups.”
On a theorem of Kontsevich.
On -bounded families of graphs.
Gyárfás, András, Zaker, Manouchehr (2011)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
The Grushko decomposition of a finite graph of finite rank free groups: an algorithm.
Diao, Guo-An, Feighn, Mark (2005)
Geometry & Topology
Similarity:
On external-memory planar depth first search.
Arge, Lars, Meyer, Ulrich, Toma, Laura, Zeh, Norbert (2003)
Journal of Graph Algorithms and Applications
Similarity:
Two extremal problems in graph theory.
Brualdi, Richard A., Mellendorf, Stephen (1994)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
Subgraph isomorphism in planar graphs and related problems.
Eppstein, David (1999)
Journal of Graph Algorithms and Applications
Similarity:
The distance between various orientations of a graph
Bohdan Zelinka (1988)
Mathematica Slovaca
Similarity:
Counting points of slope varieties over finite fields.
Enkosky, Thomas (2011)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
L(2, 1)-Labelings of Some Families of Oriented Planar Graphs
Sagnik Sen (2014)
Discussiones Mathematicae Graph Theory
Similarity:
In this paper we determine, or give lower and upper bounds on, the 2-dipath and oriented L(2, 1)-span of the family of planar graphs, planar graphs with girth 5, 11, 16, partial k-trees, outerplanar graphs and cacti.
Weak Saturation Numbers for Sparse Graphs
Ralph J. Faudree, Ronald J. Gould, Michael S. Jacobson (2013)
Discussiones Mathematicae Graph Theory
Similarity:
For a fixed graph F, a graph G is F-saturated if there is no copy of F in G, but for any edge e ∉ G, there is a copy of F in G + e. The minimum number of edges in an F-saturated graph of order n will be denoted by sat(n, F). A graph G is weakly F-saturated if there is an ordering of the missing edges of G so that if they are added one at a time, each edge added creates a new copy of F. The minimum size of a weakly F-saturated graph G of order n will be denoted by wsat(n, F). The graphs...
Upper Bounds for the Strong Chromatic Index of Halin Graphs
Ziyu Hu, Ko-Wei Lih, Daphne Der-Fen Liu (2018)
Discussiones Mathematicae Graph Theory
Similarity:
The strong chromatic index of a graph G, denoted by χ′s(G), is the minimum number of vertex induced matchings needed to partition the edge set of G. Let T be a tree without vertices of degree 2 and have at least one vertex of degree greater than 2. We construct a Halin graph G by drawing T on the plane and then drawing a cycle C connecting all its leaves in such a way that C forms the boundary of the unbounded face. We call T the characteristic tree of G. Let G denote a Halin graph with...