default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDGraphs and Combinatorics, Volume 39
Volume 39, Number 1, February 2023
- Morteza Hasanvand
:
The Existence of Planar 4-Connected Essentially 6-Edge-Connected Graphs with No Claw-Decompositions. 1 - Junyao Pan:
On a Conjecture About Strong Pattern Avoidance. 2 - Abderrahim Boussaïri, Brahim Chergui, Pierre Ille, Mohamed Zaidi:
Critical 3-Hypergraphs. 3 - Zuosong Liang, Juan Wang, Chunsong Bai:
A Generalization of Grötzsch Theorem on the Local-Equitable Coloring. 4 - Ali Ghalavand, Michael A. Henning, Mostafa Tavakoli:
On a Conjecture About the Local Metric Dimension of Graphs. 5 - Claribet Piña, Carlos Uzcátegui:
Reconstruction of a Coloring from its Homogeneous Sets. 6 - Kirsti Kuenzel, Douglas F. Rall:
On Independent Domination in Direct Products. 7 - Pablo Henrique Perondi, Emerson L. Monte Carmelo:
Perfect One-Factorizations Arising from the Lee Metric. 8 - Lin-Peng Zhang, Ligong Wang:
The Maximum Spectral Radius of Graphs without Spanning Linear Forests. 9 - Xiaojie Huang, Ziwen Huang, Jian-Bo Lv:
Partitioning Planar Graphs without 4-Cycles and 6-Cycles into a Linear Forest and a Forest. 10 - Ruijing Liu, Junling Zhou:
Further Study on Optimal Data Placements for Triple Replication. 11 - Ying-Ying Tan, Jack H. Koolen, Mengyue Cao, Jongyook Park:
Correction to: Thin Q-Polynomial Distance-Regular Graphs Have Bounded c2. 12 - Lei Zhang:
New Results on k-independence of Hypergraphs. 13 - Yoshimi Egawa, Shunsuke Nakamura:
Contractible Edges and Longest Cycles in 3-Connected Graphs. 14 - Gloria Rinaldi:
Quaternionic 1-Factorizations and Complete Sets of Rainbow Spanning Trees. 15 - Zoia Masih, Manouchehr Zaker:
A Comparison of the Grundy and b-Chromatic Number of K2,t -Free Graphs. 16 - Seungjae Eom, Kenta Ozeki:
A 2-Bisection with Small Number of Monochromatic Edges of a Claw-Free Cubic Graph. 17 - Yunus Emre Demirci, Tínaz Ekim, Mehmet Akif Yildiz:
Defective Ramsey Numbers and Defective Cocolorings in Some Subclasses of Perfect Graphs. 18
Volume 39, Number 2, April 2023
- Yanxin Liu, Yidong Sun, Di Zhao:
Generalized Delannoy Matrices and Their Combinatorial Properties. 19 - Jianfeng Hou, Yindong Jin, Lianying Miao, Qian Zhao:
Coloring Squares of Planar Graphs with Maximum Degree at Most Five. 20 - Yan Li, Yusheng Li, Ye Wang:
Multicolor Ramsey Numbers of Bipartite Graphs and Large Books. 21 - Lili Yuan, Jixiang Meng:
Necessary and Sufficient Conditions for Circulant Digraphs to be Antistrong, Weakly-Antistrong and Anti-Eulerian. 22 - Hengzhe Li, Huayue Liu, Jianbing Liu, Yaping Mao:
Edge-Disjoint Steiner Trees and Connectors in Graphs. 23 - Emmanouil Lardas, Evangelos Protopapas, Dimitrios M. Thilikos, Dimitris Zoros:
On Strict Brambles. 24 - James Tuite, Grahame Erskine, Nika Salia:
Turán Problems for k-Geodetic Digraphs. 25 - Sinan Hu, Yuejian Peng:
The Ramsey Number for a Forest Versus Disjoint Union of Complete Graphs. 26 - Shuya Chiba, Yoshimi Egawa, Shinya Fujita:
Minimum Number of Edges Guaranteeing the Existence of a K1, t-Factor in a Graph. 27 - Jan Petr, Julien Portier:
The Odd Chromatic Number of a Planar Graph is at Most 8. 28 - Juan Wang, Fenglei Tian, Yunlong Liu, Jingru Pang, Lianying Miao:
On Graphs of Order n with Metric Dimension n-4. 29 - Xiaodong Chen, Jingjing Li, Fuliang Lu:
Two Completely Independent Spanning Trees of P4-Free Graphs. 30 - Hengzhe Li, Ankang Wei, Shenggui Zhang:
2-(Ddge-)Connected Edge Domination Number and Matching Number. 31 - John Haslegrave:
Sum Index, Difference Index and Exclusive Sum Number of Graphs. 32 - Leilei Zhang:
A Simple Proof of Ore's Theorem on the Maximum Size of k-connected Graphs with Given Order and Diameter. 33 - Chunjiao Song, Jin Yan:
Partition and Disjoint Cycles in Digraphs. 34 - Tao Feng, Shenwei Huang:
A Note on the Rank of Inclusion Matrices. 35 - Lon H. Mitchell:
On Euclidean Distances and Sphere Representations. 36 - Masao Tsugaki, Tomoki Yamashita, Takamasa Yashima:
Panconnectivity in Bipartite Graphs with Large Degree sum. 37 - Bardia Hamedmohseni, Zahed Rahmati, Debajyoti Mondal:
Emanation Graph: A Plane Geometric Spanner with Steiner Points. 38
Volume 39, Number 3, June 2023
- Yu-Ru Liu, John C. Saunders:
Sieve Methods in Random Graph Theory. 39 - Attila Jung:
Shadow Ratio of Hypergraphs with Bounded Degree. 40 - Soukaina Zayat, Salman Ghazal:
Forbidding Couples of Tournaments and the Erdös-Hajnal Conjecture. 41 - Manh Vu Bui, Hemanshu Kaul, Michael Maxfield, Jeffrey A. Mudrock, Paul Shin, Seth Thomason:
Non-chromatic-Adherence of the DP Color Function via Generalized Theta Graphs. 42 - Wei Dong, Baogang Xu, Yian Xu:
A Tight Linear Bound to the Chromatic Number of $(P_5, K_1+(K_1\cup K_3))$-Free Graphs. 43 - Jun Ma, Frédéric Toumazet, Jiaqi Wang:
The Eulerian Distribution on k-Colored Involutions. 44 - Hyunggi Kim, Sangyop Lee, Seungsang Oh:
Domino Tilings of Aztec Octagons. 45 - Chunlin You, Qizhong Lin:
Three-Color Ramsey Number of an Odd Cycle Versus Bipartite Graphs with Small Bandwidth. 46 - Wenling Zhou, Binlong Li:
The Turán number of directed paths and oriented cycles. 47 - Pat Devlin, Erin Meger, Abigail Raz:
The Explorer-Director Game on Graphs. 48 - Alain Hertz, Hadrien Mélot, Sébastien Bonte, Gauvain Devillez, Pierre Hauweele:
Upper Bounds on the Average Number of Colors in the Non-equivalent Colorings of a Graph. 49 - Zhenzhen Li, Baoyindureng Wu:
Conflict-Free Connection Number of Graphs with Four Bridges. 50 - Benjamin Friedman, Sean McGuinness:
Girth Conditions and Rota's Basis Conjecture. 51 - Yingui Pan, Chang Liu:
Spectral Radius and Fractional Perfect Matchings in Graphs. 52 - Grigoriy Blekherman, Annie Raymond:
A New Proof of the Erdős-Simonovits Conjecture on Walks. 53 - Jinyu Zou, Zhao Wang, Hong-Jian Lai, Yaping Mao:
Gallai-Ramsey Numbers Involving a Rainbow 4-Path. 54 - Lanchao Wang, Yaojun Chen:
The Connectedness of the Friends-and-Strangers Graph of a Lollipop and Others. 55 - Dániel Gerbner:
Paths are Turán-good. 56 - Shude Long, Han Ren:
Upper Bounds on the Chromatic Polynomial of a Connected Graph with Fixed Clique Number. 57 - Yuquan Lin, Wensong Lin:
The Tight Bound for the Strong Chromatic Indices of Claw-Free Subcubic Graphs. 58 - David Avis, Duc A. Hoang:
On Reconfiguration Graphs of Independent Sets Under Token Sliding. 59 - Jing Guo, Heping Zhang:
Minimally k-Factor-Critical Graphs for Some Large k. 60 - Mouhamad El Joubbeh:
Minimum Separators and Menger's Theorem. 61 - Zohair Raza Hassan, Yu Jiang, David E. Narváez, Stanislaw P. Radziszowski, Xiaodong Xu:
On Some Generalized Vertex Folkman Numbers. 62
Volume 39, Number 4, August 2023
- Paul M. Terwilliger:
A Q-Polynomial Structure Associated with the Projective Geometry LN(q). 63 - Panpan Wang, Liming Xiong:
Forbidden Pairs for Connected Even Factors in Supereulerian Graphs. 64 - Marc Hellmuth, Katharina T. Huber, Vincent Moulton, Guillaume E. Scholz, Peter F. Stadler:
Injective Split Systems. 65 - István Kovács:
Classification of edge-transitive Nest graphs. 66 - Gradin Anderson, Andrew Haviland, Mckay Holmes, Stephen P. Humphries, Bonnie Magland:
Difference Sets Disjoint from a Subgroup III: The Skew Relative Cases. 67 - Niko Tratnik, Dong Ye:
Resonance Graphs on Perfect Matchings of Graphs on Surfaces. 68 - Qiaoping Guo, Ruixia Wang, Wei Meng, Chunfang Li:
A Sufficient Condition for Vertex Bipancyclicity in Balanced Bipartite Graphs. 69 - Hong-Yu Chen, Hong-Jian Lai:
On the Linear Arboricity of Graphs with Treewidth at Most Four. 70 - Logan Post, Zeyu Zheng:
Common Kings of a Chain of Cycles in a Strong Tournament. 71 - Yu Jing, Wenqian Zhang, Shengjin Ji:
The Zero Forcing Number of Graphs with the Matching Number and the Cyclomatic Number. 72 - Hong Yang, Juan Liu, Jixiang Meng:
Antidirected Hamiltonian Paths and Cycles of Digraphs with α 2-Stable Number 2. 73 - Shi-Cai Gong, Jia-Xin Wang, Shao-Wei Sun:
On 4-Sachs Optimal Graphs. 74 - Caroline Daugherty, Joshua D. Laison, Rebecca Robinson, Kyle Salois:
Intersection Graphs of Maximal Sub-polygons of k-Lizards. 75 - Lin Yang, Sheng-Liang Yang, Tian-Xiao He:
Summations on the Diagonals of a Riordan Array and Some Applications. 76 - Alberto Seeger:
New Results on Complementarity Spectra of Connected Graphs. 77 - Conglei Zhang, Yanying Wang, Zhiguo Zhang, Wei Dai:
Homotopy and Hom Construction in the Category of Finite Hypergraphs. 78 - Christoph Brause, Stanislav Jendrol', Ingo Schiermeyer:
Loose Edge-Connection of Graphs. 79 - Diana Dziewa-Dawidczyk, Adam J. Przezdziecki:
Undirected Determinant and Its Complexity. 80 - Hongkui Wang, Xinmin Hou:
Maximal Fractional Cross-Intersecting Families. 81 - William Linz:
Improved Lower Bounds on the Extrema of Eigenvalues of Graphs. 82 - Akihiro Higashitani, Yumi Yamada:
The Distribution of Roots of Ehrhart Polynomials for the Dual of Root Polytopes of Type C. 83 - Alexander L. Gavrilyuk, Roman Nedela, Ilia Ponomarenko:
The Weisfeiler-Leman Dimension of Distance-Hereditary Graphs. 84 - Michitaka Furuya, Mikio Kano:
Factors with Red-Blue Coloring of Claw-Free Graphs and Cubic Graphs. 85 - Novi H. Bong, Joshua Carlson, Bryan Curtis, Ruth Haas, Leslie Hogben:
Isomorphisms and Properties of TAR Graphs for Zero Forcing and Other X-set Parameters. 86 - Dijian Wang, Yaoping Hou, Deqiong Li:
Signed Graphs with All But Two Eigenvalues Equal to ± 1. 87 - David Avis, Duc A. Hoang:
Correction to: On Reconfiguration Graphs of Independent Sets Under Token Sliding. 88 - Lei Zhang, Liming Xiong, Jianhua Tu:
Edge-Diameter of a Graph and Its Longest Cycles. 89 - Toru Hasunuma:
Completely Independent Spanning Trees in Line Graphs. 90 - Jiansheng Cai, Weihao Xia, Guiying Yan:
Quasi rmps-Pancyclicity of Regular Multipartite Tournament. 91 - Le Xuan Hung, Ngo Dac Tan:
Vertex-Disjoint Cycles of Different Lengths in Local Tournaments. 92 - Hongliang Lu, Zixuan Yang:
On Critical Difference, Independence Number and Matching Number of Graphs. 93
Volume 39, Number 5, October 2023
- Douglas B. West, Xuding Zhu:
2-Reconstructibility of Strongly Regular Graphs and 2-Partially Distance-Regular Graphs. 94 - Paul Renteln:
On the Spectra of Simplicial Rook Graphs. 95 - Warren Singh, Timothy Sun:
Settling the Nonorientable Genus of the Nearly Complete Bipartite Graphs. 96 - Shital Dilip Solanki, Ganesh Mundhe, Santosh Baburao Dhotre:
Cographic Splitting of Graphic Matroids Using a Set with Three Elements. 97 - András Gyárfás, Gábor N. Sárközy:
Proper Edge Colorings of Cartesian Products with Rainbow C4-s. 98 - Wei Yang, Baoyindureng Wu:
Dominating Sets Inducing Large Component in Graphs with Minimum Degree Two. 99 - Ritesh Goenka, Pardis Semnani, Chi Hoi Yip:
An Exponential Bound for Simultaneous Embeddings of Planar Graphs. 100 - Penny Haxell, Reza Naserasr:
A Note on Δ-Critical Graphs. 101 - Shu-Guang Guo, Rong Zhang:
Maxima of the Q-Spectral Radius of C3 (C4)-Free Graphs with Given Size and Minimum Degree $\delta \ge 2$. 102 - Wayne Goddard, Michael A. Henning:
Graphs with Unique Minimum Specified Domination Sets. 103 - Alireza Mofidi:
On Dominating Graph of Graphs, Median Graphs, Partial Cubes and Complement of Minimal Dominating Sets. 104 - Thomas Einolf, Robert Muth, Jeffrey Wilkinson:
Injectively k-Colored Rooted Forests. 105 - Di Wu, Baogang Xu:
Coloring of Some Crown-Free Graphs. 106 - Yahav Alon:
The Global Resilience of Hamiltonicity in G(n, p). 107 - Himadri Shekhar Chakraborty, Tsuyoshi Miezaki, Chong Zheng:
Weighted Tutte-Grothendieck Polynomials of Graphs. 108 - Xiaoyuan Dong, Jinhua Wang:
Frames and Doubly Resolvable Group Divisible Designs with Block Size Three and Index Two. 109 - Yidong Sun, Weichen Wang, Cheng Sun:
The bfuvu-Avoiding (a, b, c)-Generalized Motzkin Paths with Vertical Steps: Bijections and Statistic Enumerations. 110 - Csaba D. Tóth, Jorge Urrutia, Giovanni Viglietta:
Minimizing Visible Edges in Polyhedra. 111 - Alexander F. Sidorenko:
Modified Erdős-Ginzburg-Ziv Constants for $\mathbb {Z}_2^{d}$. 112
Volume 39, Number 6, December 2023
- Tingzeng Wu, Xiaolin Zeng, Huazhong Lü:
On the Roots of (Signless) Laplacian Permanental Polynomials of Graphs. 113 - Rahul Gangopadhyay, Ayan:
Maximum Rectilinear Crossing Number of Uniform Hypergraphs. 114 - Fangyu Tian, Xiangwen Li:
A (2, 1)-Decomposition of Planar Graphs Without Intersecting 3-Cycles and Adjacent 4--Cycles. 115 - Mingfang Huang, Guorong Liu, Xiangqian Zhou:
Strong List-Chromatic Index of Planar Graphs with Ore-Degree at Most Seven. 116 - Qing Cui, Jingshu Zhang:
A Sharp Upper Bound on the Cycle Isolation Number of Graphs. 117 - Xiangwen Li, Jie Liu, Jian-Bo Lv:
Every planar graph without 4-cycles and 5-cycles is (3,3)-colorable. 118 - Jiayi Xie, Gengsheng Zhang:
On Quasi-strongly Regular Graphs with Parameters (n,k,a;k-2,c2) (I). 119 - Jia-Li Du, Fugang Yin, Menglin Ding:
Cubic Graphs Admitting Vertex-Transitive Almost Simple Groups. 120 - Kenta Mori:
Toric Rings of Perfectly Matchable Subgraph Polytopes. 121 - Sho Kubota, Sho Suda, Akane Urano:
Mutually Orthogonal Sudoku Latin Squares and Their Graphs. 122 - Michael A. Henning, Kusum, Arti Pandey, Kaustav Paul:
Complexity of Total Dominator Coloring in Graphs. 128 - Guangfu Wang, Zhikun Xiong, Lijun Chen:
l1-embeddability of shifted quadrilateral cylinder graphs. 129 - Yidong Sun, Weichen Wang, Cheng Sun:
Correction to: The uvu-Avoiding (a, b, c)-Generalized Motzkin Paths with Vertical Steps: Bijections and Statistic Enumerations. 123 - Shanshan Guo, Fei Huang, Jinjiang Yuan:
Proper Cycles and Rainbow Cycles in 2-triangle-free edge-colored Complete Graphs. 124 - Kaiyang Lan, Feng Liu:
The Chromatic Number of a Graph with Two Odd Holes and an Odd Girth. 125 - Yaping Mao:
Size Gallai-Ramsey Number. 126 - Rui Li, Tao Wang:
Variable Degeneracy on Toroidal Graphs. 127
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
last updated on 2025-02-20 19:45 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
