:: Library Catalog

Imagen de Portada

Guardado en:

Detalles Bibliográficos
Autores principales:	Filmus, Yuval, Fischer, Eldar, Makowsky, Johann A.
Formato:	Preprint
Publicado:	2025
Materias:	Combinatorics 05, 05C30
Acceso en línea:	https://arxiv.org/abs/2502.10212
Etiquetas:	Agregar Etiqueta Sin Etiquetas, Sea el primero en etiquetar este registro!

Ejemplares similares

Meta-theorems for Graph Polynomials
por: Makowsky, Johann A.
Publicado: (2024)

Counting Finite Topologies
por: Fischer, Eldar, et al.
Publicado: (2023)

Distinctive power and comparability of Harary polynomial
por: Makowsky, Johann A.
Publicado: (2025)

Courcelle's Theorem Without Logic
por: Filmus, Yuval, et al.
Publicado: (2025)

Automated Counting of Spanning Trees for Several Infinite Families of Graphs
por: Blanco, Pablo, et al.
Publicado: (2025)

Effective resistance and spanning trees in complete graphs with distance-class deletions
por: Tamura, Shunya
Publicado: (2026)

Terwilliger algebras and some related algebras defined by finite connected simple graphs
por: Hanaki, Akihide, et al.
Publicado: (2021)

On the enumeration of connected sets in finite cylindrical lattice graphs
por: Ma, Hongxia, et al.
Publicado: (2025)

The bipartite analogue of a classical spanning tree enumeration formula, Boolean functions, and their applications to counting odd spanning trees
por: Ge, Jun, et al.
Publicado: (2026)

Encoding and Enumerating Acyclic Orientations of Graphs
por: Carballosa, Walter, et al.
Publicado: (2023)

A note on plane trees with decreasing labels
por: Cheung, Tsun-Ming, et al.
Publicado: (2025)

Maximum number of spanning trees and connectivity: Graphs with a fixed minimum degree and bipartite graphs
por: Xu, Shaohan, et al.
Publicado: (2025)

Combinatorial Identities Using the Matrix Tree Theorem
por: Deepthi, Nayana Shibu, et al.
Publicado: (2025)

Mutual-Visibility of Tree and Its Line Graphs
por: B, Tonny K, et al.
Publicado: (2026)

Upper bound for the number of maximal dissociation sets in trees
por: Wang, Ziyuan, et al.
Publicado: (2024)

Nordhaus-Gaddum inequalities for the number of 1-nearly independent vertex subsets
por: Andriantiana, Eric O. D., et al.
Publicado: (2026)

Enumerative Chromatic Choosability
por: Allred, Sarah, et al.
Publicado: (2025)

On Polynomial Representations of Dual DP Color Functions
por: Mudrock, Jeffrey A., et al.
Publicado: (2024)

Counting Packings of List-colorings of Graphs
por: Kaul, Hemanshu, et al.
Publicado: (2024)

Enumeratively Chromatic-Choosable Theta Graphs
por: Chi, Yanghong, et al.
Publicado: (2026)

On the DP-chromatic Number of Cartesian Products of Critical Graphs
por: Kaul, Hemanshu, et al.
Publicado: (2025)

On the enumeration of permutations avoiding chains of patterns
por: Zhou, Robin D. P., et al.
Publicado: (2024)

Difference ascent sequences and related combinatorial structures
por: Zang, Yongchun, et al.
Publicado: (2024)

On Polynomial Representations of the DP Color Function: Theta Graphs and Their Generalizations
por: Halberg, Charlie, et al.
Publicado: (2020)

Fibonacci and Lucas numbers arising from two-component spanning forests of wheel graphs
por: Miezaki, Tsuyoshi, et al.
Publicado: (2025)

On extremal properties of perfect 2-colorings
por: Potapov, Vladimir N.
Publicado: (2022)

Enumerating Cayley digraphs on dihedral groups
por: Lu, Zai Ping, et al.
Publicado: (2025)

Mutual visibility in Moore graphs and $(d,2)$-graphs with defect
por: B, Tonny K, et al.
Publicado: (2025)

Subgraphs in random graphs with specified degrees and forbidden edges
por: Larkin, John, et al.
Publicado: (2025)

The subpath number of cactus graphs
por: Knor, Martin, et al.
Publicado: (2025)

Invitation to the subpath number
por: Knor, Martin, et al.
Publicado: (2025)

Deranged Perfect Matchings on complete graph and balanced complete r-partite graph
por: Deng, Boqing
Publicado: (2025)

$2$-Restricted Optimal Pebbling Number of Some Graphs
por: Dehqan, Juma Gul, et al.
Publicado: (2025)

Symmetric and unimodal independence polynomials of trees
por: Hibi, Takayuki, et al.
Publicado: (2026)

Counting geodesic paths in graphs
por: Knor, Martin, et al.
Publicado: (2026)

Arithmetical Structures on Coconut Trees
por: Diaz-Lopez, Alexander, et al.
Publicado: (2024)

On the number of connected edge cover sets in a graph
por: Zare, Mahsa, et al.
Publicado: (2024)

Closed-form expansions for the universal edge elimination polynomial
por: Dohmen, Klaus
Publicado: (2014)

Generalized Turán problem with bounded matching number
por: Ma, Yue, et al.
Publicado: (2023)

On enumeration of spanning trees of complete multipartite graphs containing a fixed spanning forest
por: Wang, Wei, et al.
Publicado: (2026)