On the number of genus one labeled circle trees.
Mészáros, Karola (2007)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
Displaying similar documents to “Trees and matchings.”
On the number of genus one labeled circle trees.
Two extremal problems in graph theory.
Brualdi, Richard A., Mellendorf, Stephen (1994)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
Counting points of slope varieties over finite fields.
Enkosky, Thomas (2011)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
On graceful trees.
Hegde, Suresh Manjanath, Shetty, Sudhakar (2002)
Applied Mathematics E-Notes [electronic only]
Similarity:
Symmetric Laman theorems for the groups and .
Schulze, Bernd (2010)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
Total edge irregularity strength of trees
Jaroslav Ivančo, Stanislav Jendrol' (2006)
Discussiones Mathematicae Graph Theory
Similarity:
A total edge-irregular k-labelling ξ:V(G)∪ E(G) → {1,2,...,k} of a graph G is a labelling of vertices and edges of G in such a way that for any different edges e and f their weights wt(e) and wt(f) are distinct. The weight wt(e) of an edge e = xy is the sum of the labels of vertices x and y and the label of the edge e. The minimum k for which a graph G has a total edge-irregular k-labelling is called the total edge irregularity strength of G, tes(G). In this paper we prove that...
Quartet compatibility and the quartet graph.
Grünewald, Stefan, Humphries, Peter J., Semple, Charles (2008)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
Tutte polynomial, subgraphs, orientations and sandpile model: new connections via embeddings.
Bernardi, Olivier (2008)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
Building graphs from colored trees.
Esselstein, Rachel M., Winkler, Peter (2010)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
Generalized Cauchy identities, trees and multidimensional Brownian motions. I: Bijective proof of generalized Cauchy identities.
Śniady, Piotr (2006)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
An algorithmic Friedman-Pippenger theorem on tree embeddings and applications.
Dellamonica, Domingos jun., Kohayakawa, Yoshiharu (2008)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
Noncrossing trees and noncrossing graphs.
Chen, William Y.C., Yan, Sherry H.F. (2006)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
Two new classes of trees embeddable into hypercubes
Mounira Nekri, Abdelhafid Berrachedi (2004)
RAIRO - Operations Research - Recherche Opérationnelle
Similarity:
The problem of embedding graphs into other graphs is much studied in the graph theory. In fact, much effort has been devoted to determining the conditions under which a graph G is a subgraph of a graph H, having a particular structure. An important class to study is the set of graphs which are embeddable into a hypercube. This importance results from the remarkable properties of the hypercube and its use in several domains, such as: the coding theory, transfer of information, multicriteria...