Result Number | Material Type | Add to My Shelf Action | Record Details and Options |
---|---|---|---|
1 |
Material Type: Artigo
|
![]() |
Settling the Nonorientable Genus of the Nearly Complete Bipartite GraphsSingh, Warren ; Sun, TimothyGraphs and combinatorics, 2023-10, Vol.39 (5), Article 96 [Periódico revisado por pares]Tokyo: Springer JapanTexto completo disponível |
2 |
Material Type: Artigo
|
![]() |
Sieve Methods in Random Graph TheoryLiu, Yu-Ru ; Saunders, J. C.Graphs and combinatorics, 2023-06, Vol.39 (3), Article 39 [Periódico revisado por pares]Tokyo: Springer JapanTexto completo disponível |
3 |
Material Type: Artigo
|
![]() |
Supersaturation for Subgraph CountsCutler, Jonathan ; Nir, JD ; Radcliffe, A. J.Graphs and combinatorics, 2022-06, Vol.38 (3), Article 65 [Periódico revisado por pares]Tokyo: Springer JapanTexto completo disponível |
4 |
Material Type: Artigo
|
![]() |
Spectral Threshold for Extremal Cyclic Edge-ConnectivityAksoy, Sinan G. ; Kempton, Mark ; Young, Stephen J.Graphs and combinatorics, 2021-11, Vol.37 (6), p.2079-2093 [Periódico revisado por pares]Tokyo: Springer JapanTexto completo disponível |
5 |
Material Type: Artigo
|
![]() |
Bounding the Number of Non-duplicates of the q-Side in Simple Drawings of Kp,qRichter, R. Bruce ; Silva, André C. ; Lee, OrlandoGraphs and combinatorics, 2021, Vol.37 (6), p.2697-2701 [Periódico revisado por pares]Tokyo: Springer JapanTexto completo disponível |
6 |
Material Type: Artigo
|
![]() |
On the Relation of Separability, Bandwidth and EmbeddingCsaba, Béla ; Vásárhelyi, BálintGraphs and combinatorics, 2019-11, Vol.35 (6), p.1541-1553 [Periódico revisado por pares]Tokyo: Springer JapanTexto completo disponível |
7 |
Material Type: Artigo
|
![]() |
On the Maximum Diameter of Path-Pairable GraphsGirão, António ; Popielarz, Kamil ; Mészáros, Gábor ; Snyder, RichardGraphs and combinatorics, 2019-11, Vol.35 (6), p.1647-1657 [Periódico revisado por pares]Tokyo: Springer JapanTexto completo disponível |
8 |
Material Type: Artigo
|
![]() |
Extremal Threshold Graphs for Matchings and Independent SetsKeough, L. ; Radcliffe, A. J.Graphs and combinatorics, 2018-11, Vol.34 (6), p.1519-1537 [Periódico revisado por pares]Tokyo: Springer JapanTexto completo disponível |
9 |
Material Type: Artigo
|
![]() |
On a Problem by Shapozenko on Johnson GraphsDiego, Víctor ; Serra, Oriol ; Vena, LluísGraphs and combinatorics, 2018-09, Vol.34 (5), p.947-964 [Periódico revisado por pares]Tokyo: Springer JapanTexto completo disponível |
10 |
Material Type: Artigo
|
![]() |
Connected Colourings of Complete Graphs and HypergraphsLeader, Imre ; Tan, Ta ShengGraphs and combinatorics, 2016, Vol.32 (1), p.257-269 [Periódico revisado por pares]Tokyo: Springer JapanTexto completo disponível |