A characterization of self-complementary graphs of order 8
Page 1 Next
Displaying 1 – 20 of 205
A combinatorial derivation of the number of labeled forests.
Callan, David (2003)
Journal of Integer Sequences [electronic only]
A combinatorial proof of Postnikov's identity and a generalized enumeration of labeled trees.
Seo, Seunghyun (2005)
The Electronic Journal of Combinatorics [electronic only]
A complete grammar for decomposing a family of graphs into 3-connected components.
Chapuy, Guillaume, Fusy, Éric, Kang, Mihyun, Shoilekova, Bilyana (2008)
The Electronic Journal of Combinatorics [electronic only]
A direct decomposition of 3-connected planar graphs.
Bodirsky, Manuel, Gröpl, Clemens, Johannsen, Daniel, Kang, Mihyun (2005)
Séminaire Lotharingien de Combinatoire [electronic only]
A formula for the bivariate map asymptotics constants in terms of the univariate map asymptotics constants.
Gao, Zhicheng (2010)
The Electronic Journal of Combinatorics [electronic only]
A Generalization of the Matrix-Tree Theorem.
Mordechai Lewin (1982)
Mathematische Zeitschrift
A generating function for fatgraphs
P. Di Francesco, C. Itzykson (1993)
Annales de l'I.H.P. Physique théorique
A Lower Bound for the Optimal Crossing-Free Hamiltonian Cycle Problem.
R.B. Hayward (1987)
Discrete & computational geometry
A new class of enumeration problems
Robert H. Johnson (1974)
Czechoslovak Mathematical Journal
A new spectral method for determining the number of spanning trees.
Cvetkovic, D.M., Gutman, I. (1981)
Publications de l'Institut Mathématique. Nouvelle Série
A non-differentiablity result for the inversion operator between Sobolev spaces.
Farkas, G., Garay, B.M. (2000)
Zeitschrift für Analysis und ihre Anwendungen
A note on intersection dimensions of graph classes
Petr Hliněný, Aleš Kuběna (1995)
Commentationes Mathematicae Universitatis Carolinae
The intersection dimension of a graph with respect to a class of graphs is the minimum such that is the intersection of some graphs on the vertex set belonging to . In this paper we follow [ Kratochv’ıl J., Tuza Z.: Intersection dimensions of graph classes, Graphs and Combinatorics 10 (1994), 159–168 ] and show that for some pairs of graph classes , the intersection dimension of graphs from with respect to is unbounded.
A note on major sequences and external activity in trees.
Beissinger, Janet S., Peled, Uri N. (1997)
The Electronic Journal of Combinatorics [electronic only]
A note on the distribution of the three types of nodes in uniform binary trees.
Prodinger, Helmut (1996)
Séminaire Lotharingien de Combinatoire [electronic only]
A note on the total number of double Eulerian circuits in multigraphs.
Liskovets, Valery (2002)
Journal of Integer Sequences [electronic only]
A partition of connected graphs.
Wiseman, Gus (2005)
The Electronic Journal of Combinatorics [electronic only]
A partition of the Catalan numbers and enumeration of genealogical trees
Rainer Schimming (1996)
Discussiones Mathematicae Graph Theory
A special relational structure, called genealogical tree, is introduced; its social interpretation and geometrical realizations are discussed. The numbers of all abstract genealogical trees with exactly n+1 nodes and k leaves is found by means of enumeration of code words. For each n, the form a partition of the n-th Catalan numer Cₙ, that means .
A proof of some Schützenberger-type results for Eulerian paths and circuits on digraphs.
Chwe, Byoung-Song (1994)
International Journal of Mathematics and Mathematical Sciences
Acyclic digraphs and eigenvalues of -matrices.
McKay, Brendan D., Oggier, Frédérique E., Royle, Gordon F., Sloane, N.J.A., Wanless, Ian M., Wilf, Herbert S. (2004)
Journal of Integer Sequences [electronic only]
Currently displaying 1 – 20 of 205
Page 1 Next