:: Library Catalog

Imagen de Portada

Guardado en:

Detalles Bibliográficos
Autores principales:	Camp, Heidi Van den, McKay, Brendan D.
Formato:	Preprint
Publicado:	2024
Materias:	Combinatorics 05C30
Acceso en línea:	https://arxiv.org/abs/2402.10676
Etiquetas:	Agregar Etiqueta Sin Etiquetas, Sea el primero en etiquetar este registro!

Ejemplares similares

Asymptotic enumeration of graph factors by cumulant expansion
por: Isaev, Mikhail, et al.
Publicado: (2025)

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

Preserving and Increasing Symmetries of Polyhedral Maps
por: Brinkmann, Gunnar, et al.
Publicado: (2024)

Cumulant expansion for counting Eulerian orientations
por: Isaev, Mikhail, et al.
Publicado: (2023)

Ramsey numbers for regular induced subgraphs
por: Dyson, Paul W., et al.
Publicado: (2026)

Algorithms for the Generation of Snarks
por: Brinkmann, Gunnar, et al.
Publicado: (2026)

Sprinkling with random regular graphs
por: Isaev, Mikhail, et al.
Publicado: (2023)

The Cycle Counts of Graphs
por: McCulloch, Ryan, et al.
Publicado: (2025)

Enumeration of regular multipartite hypergraphs
por: Isaev, Mikhail, et al.
Publicado: (2025)

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

Exploring the Influence of Graph Operations on Zero Forcing Sets
por: Menon, Krishna, et al.
Publicado: (2024)

Asymptotic enumeration of constrained bipartite, directed and oriented graphs by degree sequence
por: Greenhill, Catherine, et al.
Publicado: (2026)

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

Diameter of General Knödel Graphs
por: Musawi, Seyed Reza, et al.
Publicado: (2020)

Correlation between residual entropy and spanning tree entropy of ice-type models on graphs
por: Isaev, Mikhail, et al.
Publicado: (2024)

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

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

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

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)

On the spouse-loving variant of the Oberwolfach problem
por: Bolohan, Noah, et al.
Publicado: (2024)

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)

Effective MC-finiteness
por: Filmus, Yuval, et al.
Publicado: (2025)

A permutation based approach to the $q$-deformation of the Dynkin Operator
por: Grinberg, Darij, et al.
Publicado: (2025)

$R(5,5)\le 46$
por: Angeltveit, Vigleik, et al.
Publicado: (2024)

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)

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)

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)

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)

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

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

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

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

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

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

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