EuDML | Browse

Skip to main content (access key 's'), Skip to navigation (access key 'n'), Accessibility information (access key '0')

Subjects
05-XX Combinatorics
05Cxx Graph theory
05C30 Enumeration in graph theory

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.

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.

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.

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.

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.

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.

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.

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.

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.

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.

Items

All a b c d e f g h i j k l m n o p q r s t u v w x y z Other

Previous Page 5 Next

Displaying 81 – 100 of 205

Enumeration of hamiltonian paths in Caley diagrams.

David Housman (1981)

Aequationes mathematicae

Enumeration of perfect matchings of a type of quadratic lattice on the torus.

Lu, Fuliang, Zhang, Lianzhu, Lin, Fenggen (2010)

The Electronic Journal of Combinatorics [electronic only]

Enumeration problems of trees. (Abzählprobleme bei Bäumen.)

Prodinger, Helmut (1983)

Séminaire Lotharingien de Combinatoire [electronic only]

Enumeration under group action

Gian-Carlo Rota, David A. Smith (1977)

Annali della Scuola Normale Superiore di Pisa - Classe di Scienze

Enumerative formulae for unrooted planar maps: a pattern.

Liskovets, Valery A. (2004)

The Electronic Journal of Combinatorics [electronic only]

Enumerative problems inspired by Mayer's theory of cluster integrals.

Leroux, Pierre (2004)

The Electronic Journal of Combinatorics [electronic only]

Equivalence classes of functions on finite sets.

Chao, Chong-Yun, Deisher, Caroline I. (1982)

International Journal of Mathematics and Mathematical Sciences

Equivalence of a Number-Theoretical Problem with a Problem from the Graph Theory

Štefan Znám (1967)

Matematický časopis

Euler's idoneal numbers and an inequality concerning minimal graphs with a prescribed number of spanning trees

Jernej Azarija, Riste Škrekovski (2013)

Mathematica Bohemica

Let $α (n)$ be the least number $k$ for which there exists a simple graph with $k$ vertices having precisely $n \geq 3$ spanning trees. Similarly, define $β (n)$ as the least number $k$ for which there exists a simple graph with $k$ edges having precisely $n \geq 3$ spanning trees. As an $n$ -cycle has exactly $n$ spanning trees, it follows that $α (n), β (n) \leq n$ . In this paper, we show that $α (n) \leq \frac{1}{3} (n + 4)$ and $β (n) \leq \frac{1}{3} (n + 7)$ if and only if $n \notin {3, 4, 5, 6, 7, 9, 10, 13, 18, 22}$ , which is a subset of Euler’s idoneal numbers. Moreover, if $n \neg \equiv 2 (mod 3)$ and $n \neq 25$ we show that $α (n) \leq \frac{1}{4} (n + 9)$ and $β (n) \leq \frac{1}{4} (n + 13) .$ This improves some previously estabilished bounds.

Expanding stars

S. F. Kapoor (1973)

Colloquium Mathematicae

Explicit enumeration of triangulations with multiple boundaries.

Krikun, Maxim (2007)

The Electronic Journal of Combinatorics [electronic only]

Faster backtracking algorithms for the generation of symmetry-invariant permutations.

Moreno, Oscar, Ramírez, John, Bollman, Dorothy, Orozco, Edusmildo (2002)

Journal of Applied Mathematics

Flexibility of embeddings of bouquets of circles on the projective plane and Klein bottle.

Yang, Yan, Liu, Yanpei (2007)

The Electronic Journal of Combinatorics [electronic only]

Graph compositions. I: Basic enumeration.

Knopfmacher, A., Mays, M.E. (2001)

Integers

Graph weights arising from Mayer's theory of cluster integrals.

Labelle, Gilbert, Leroux, Pierre, Ducharme, Martin G. (2005)

Séminaire Lotharingien de Combinatoire [electronic only]

Graphs and associative triples in quasitrivial groupoids

Tomáš Kepka, Jan Kratochvíl (1984)

Commentationes Mathematicae Universitatis Carolinae

Graphs and quasitrivial groupoids

Milan Vítek (1986)

Acta Universitatis Carolinae. Mathematica et Physica

Groupoids with non-associative triples on the diagonal

Aleš Drápal (1985)

Czechoslovak Mathematical Journal

Hamiltonian paths on Platonic graphs.

Hopkins, Brian (2004)

International Journal of Mathematics and Mathematical Sciences

How frequently is a system of 2-linear Boolean equations solvable?

Pittel, Boris, Yeum, Ji-A (2010)

The Electronic Journal of Combinatorics [electronic only]

Currently displaying 81 – 100 of 205

Previous Page 5 Next