Imagen de Portada

An infinite family of Type 1 fullerene nanodiscs

Fuente: arXiv

Guardado en:

Detalles Bibliográficos
Autores principales:	da Cruz, Mariana, Castonguay, Diane, de Figueiredo, Celina, Sasaki, Diana
Formato:	Preprint
Publicado:	2024
Materias:	Combinatorics 05C15
Acceso en línea:	Acceder al recurso
Etiquetas:	Agregar Etiqueta Sin Etiquetas, Sea el primero en etiquetar este registro!

Ejemplares similares

Computing a 3-role assignment is polynomial-time solvable on complementary prisms
por: Castonguay, Diane, et al.
Publicado: (2024)

On the pebbling numbers of Flower, Blanuša, and Watkins snarks
por: Adauto, Matheus, et al.
Publicado: (2023)

The $S$-packing coloring of the infinite diagonal grid with $S = (1,6,6,\ldots)$
por: Kittipassorn, Teeradej, et al.
Publicado: (2025)

The partition dimension and $k$-domination number of a family of non-distance regular graph
por: Zafari, Ali, et al.
Publicado: (2026)

Normal 6-edge-colorings of cubic graphs with oddness 2
por: Fabrici, Igor, et al.
Publicado: (2025)

On the spectrum of two families of non-distance-regular graphs
por: Zafari, Ali, et al.
Publicado: (2019)

The odd independence number of graphs, II: Finite and infinite grids and chessboard graphs
por: Caro, Yair, et al.
Publicado: (2025)

The asymptotic $χ$-boundedness of hereditary families
por: Reed, Bruce, et al.
Publicado: (2025)

Claw-free cubic graphs are (1, 1, 1, 3)-packing edge-colorable
por: Hou, Jingxi, et al.
Publicado: (2025)

Claw-free cubic graphs are $(1, 1, 2, 2)$-colorable
por: Brešar, Boštjan, et al.
Publicado: (2024)

Non-empty pairwise cross-intersecting families
por: Huang, Yang, et al.
Publicado: (2023)

Monochromatic infinite sets in Minkowski planes
por: Frankl, Nóra, et al.
Publicado: (2023)

Equitable Coloring in 1-Planar Graphs
por: Cranston, Daniel, et al.
Publicado: (2023)

The maximal sum of sizes of cross intersecting families for multisets
por: Wang, Hongkui, et al.
Publicado: (2024)

Thinness and its variations on some graph families and coloring graphs of bounded thinness
por: Bonomo-Braberman, Flavia, et al.
Publicado: (2023)

Total colouring of circulant graphs $C_{n}(1, 3)$
por: Su, SenYuan, et al.
Publicado: (2025)

The connection between the chromatic numbers of a hypergraph and its $1$-intersection graph
por: Blázsik, Zoltán L., et al.
Publicado: (2024)

Coloring $(P_5, \text{gem})$-free graphs with $Δ-1$ colors
por: Cranston, Daniel W., et al.
Publicado: (2020)

Every graph is uniform-span $(2,2)$-choosable: Beyond the 1-2 conjecture
por: Deng, Kecai, et al.
Publicado: (2025)

Enumeration formulas for (3, 6)-fullerenes
por: Green, Linda, et al.
Publicado: (2025)

Improper coloring of toroidal graphs
por: Kolačkovská, Alexandra, et al.
Publicado: (2025)

Homogeneous linear recurrence relations of the determinants of distance matrices of trees
por: Liu, Zhiqi, et al.
Publicado: (2025)

An Inductive Proof of Whitney's Broken Circuit Theorem
por: Dohmen, Klaus
Publicado: (2009)

Asymptotic normality of embedding distributions of some families of graphs
por: Chen, Yichao, et al.
Publicado: (2025)

A Solution to the 1-2-3 Conjecture
por: Keusch, Ralph
Publicado: (2023)

Elusive properties of countably infinite graphs
por: Elekes, Márton, et al.
Publicado: (2025)

L(3,2,1)-labelings of three classes of 4-valent circulants
por: Holub, Přemysl, et al.
Publicado: (2026)

Toward a Three-dimensional Counterpart of Cruse's Theorem
por: Bahmanian, Amin
Publicado: (2022)

Graphs with girth $2\ell+1$ and without longer odd holes that contain an odd $K_4$-subdivision
por: Chen, Rong, et al.
Publicado: (2022)

Determining the Locating Rainbow Connection Number of Vertex-Transitive Graphs
por: Bustan, Ariestha Widyastuty, et al.
Publicado: (2024)

Colour-permuting automorphisms of complete Cayley graphs
por: Alimirzaei, Shirin, et al.
Publicado: (2024)

A note on sequences variant of irregularity strength for hypercubes
por: Flaszczyńska, Anna, et al.
Publicado: (2024)

Sudoku Number of Corona of Graphs
por: Nair, Manju S, et al.
Publicado: (2024)

Planar graphs having no cycle of length $4$, $6$ or $8$ are DP-3-colorable
por: Jin, Ligang, et al.
Publicado: (2024)

Polynomials Counting Group Colorings in Graphs
por: Fu, Houshan
Publicado: (2024)

Distinguishing chromatic number of middle and subdivision graphs
por: Banerjee, Amitayu, et al.
Publicado: (2024)

A Catalog of Facially Complete Graphs
por: Tilley, James, et al.
Publicado: (2024)

A sharp upper bound for the harmonious total chromatic number of graphs and multigraphs
por: Abreu, M., et al.
Publicado: (2024)

A sequel to the adventure of RGB-tilings to explore the Four Color Theorem
por: Liu, Shu-Chung
Publicado: (2024)

On the Idempotent Graph of Matrix Ring
por: Patil, Avinash, et al.
Publicado: (2024)