Number of Spanning Trees in the Sequence of Some Graphs

&
Complexity 2019:1-22 (2019)
  Copy   BIBTEX

Abstract

This article has no associated abstract. (fix it)

Categories

Add categories

Keywords

Reprint years

DOI

10.1155/2019/4271783

Links

PhilArchive



    Upload a copy of this work     Papers currently archived: 91,386

External links

Setup an account with your affiliations in order to access resources via your University's proxy server

Through your library

My notes

Similar books and articles

Finding socially best spanning trees.Andreas Darmann, Christian Klamler & Ulrich Pferschy - 2011 - Theory and Decision 70 (4):511-527.
Relational treatment of term graphs with bound variables.W. Kahl - 1998 - Logic Journal of the IGPL 6 (2):259-303.
Succinct definitions in the first order theory of graphs.Oleg Pikhurko, Joel Spencer & Oleg Verbitsky - 2006 - Annals of Pure and Applied Logic 139 (1):74-109.
Some natural decision problems in automatic graphs.Dietrich Kuske & Markus Lohrey - 2010 - Journal of Symbolic Logic 75 (2):678-710.
Graphs with ∏ 1 0 (K)Y-sections.Boško Živaljević - 1993 - Archive for Mathematical Logic 32 (4):259-273.
Twilight graphs.J. C. E. Dekker - 1981 - Journal of Symbolic Logic 46 (3):539-571.
Spanning graphs and the Axiom of Choice.Christian Delhommé & Marianne Morillon - 2006 - Reports on Mathematical Logic:165-180.
On the finiteness of the recursive chromatic number.William I. Gasarch & Andrew C. Y. Lee - 1998 - Annals of Pure and Applied Logic 93 (1-3):73-81.
The structure of the models of decidable monadic theories of graphs.D. Seese - 1991 - Annals of Pure and Applied Logic 53 (2):169-195.
A Hypothesis On The Finiteness Of Graphs For Lukasiewicz's Precomplete Logics.Alexander Karpenko - 1986 - Bulletin of the Section of Logic 15 (3):102-106.
Classes of Ulm type and coding rank-homogeneous trees in other structures.E. Fokina, J. F. Knight, A. Melnikov, S. M. Quinn & C. Safranski - 2011 - Journal of Symbolic Logic 76 (3):846 - 869.
networksis: A Package to Simulate Bipartite Graphs with Fixed Marginals Through Sequential Importance Sampling.R. Admiraal & M. S. Handcock - unknown
An Algorithm for Fast Recovery of Sparse Causal Graphs.Peter Spirtes - unknown
Betweenness centrality measures for directed graphs.D. R. White & S. P. Borgatti - unknown
Domatic partitions of computable graphs.Matthew Jura, Oscar Levin & Tyler Markkanen - 2014 - Archive for Mathematical Logic 53 (1-2):137-155.

Analytics

Added to PP
2019-03-14

Downloads
15 (#926,042)

6 months
5 (#638,139)

Historical graph of downloads
How can I increase my downloads?

Citations of this work

Add more citations

References found in this work

No references found.

Add more references