default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDGraphs and Combinatorics, Volume 41
Volume 41, Number 1, February 2025
- Watcharintorn Ruksasakchai, Pongpat Sittitrai:
Sufficient Conditions make Graphs Edge DP-$\varDelta $-Colorable. 1 - Hortensia Galeana-Sánchez, Carlos Vilchis-Alfaro
:
Dynamic Cycles in Edge-Colored Multigraphs. 2 - Yian Xu:
Non-perfect (P5, C5, K5-e)-Free Graphs are 5-Colorable. 3 - Ameera Vaheeda Shanavas, Manoj Changat, Peter F. Stadler:
On the Cut-Vertex and the Interval Transit Functions of Hypergraphs. 4 - Viswanathan B. N, Douglas B. West:
Hamiltonian Cycles and Tight Cutsets. 5 - Seog-Jin Kim, Sang June Lee, Xiaopan Lian, Xuding Zhu:
List Dynamic 4-Coloring of Planar Graphs. 6 - Deping Song, Shuang Li, Xiao Wang:
On Fan's Conjecture About 4-Flow. 7 - Mingyuan Ma, Han Ren:
The p-Arboricity of Outerplanar Graphs. 8 - Xiaoli Yuan, Yuejian Peng:
On Generalized Turán Numbers of Intersecting Cliques. 9 - Toru Hasunuma:
Connectivity Preserving Hamiltonian Cycles in k-Connected Dirac Graphs. 10 - Wangyi Shang, Shenggui Zhang, Binlong Li, Xia Liu:
Local Degree Conditions for Hamiltonicity of Claw-Free Graphs. 11 - Yi Wang, Peixue Zhao, Fei Huang:
Rainbow Pancyclicity and Panconnectivity of Strongly Edge-Colored Graphs. 12 - Darine Al-Mniny, Salman Ghazal:
Secant edges: a tool for Cohen et al.'s conjectures about subdivisions of oriented cycles and bispindles in Hamiltonian digraphs with large chromatic number. 13 - Qiqi Huang, Weihua He, Chaoqin Zhang:
Graphs with Positive Ricci Curvature. 14 - José Miguel Díaz-Báñez, Paul Horn, Mario Alberto López, Nestaly Marín, Adriana Ramírez-Vigueras, Oriol Andreu Solé-Pi, Alex Stevens, Jorge Urrutia:
Ortho-Unit Polygons can be Guarded with at most $\left\lfloor \frac{n-4}{8} \right\rfloor $ Guards. 15 - Naivedya Amarnani, Amaury De Burgos, Wayne Broughton:
Correction: Packing and Covering Triangles in Bilaterally-Complete Tripartite Graphs. 16 - Junyao Pan, Pengfei Guo:
On the Permutations that Strongly Avoid the Pattern 312 or 231. 17 - Nguyen Thu Hang, Thanh Vu:
Projective dimension and regularity of 3-path ideals of unicyclic graphs. 18 - Richard A. Brualdi, Lei Cao, John L. Goldwasser:
12... t-Permutation Avoiding (0, 1)-Matrices. 19 - Michael C. Wigal, Xingxing Yu:
On Tutte Cycles Containing Three Prescribed Edges. 20 - Yanwei Zhao, Shenglin Zhou:
Block-Transitive 2-(v,5,λ ) Designs Admitting Automorphism Groups $S_{c} \wr S_d$. 21 - Chengfu Qin, Jin Geng, Hailing Yang, Xiaoqing Xie:
Contractible Edges in Spanning Trees of 3-Connected Graphs. 22 - Sanchita Paul:
On Some Subclasses of Oriented Catch Digraphs. 23 - Yongke Qu, Yuanlin Li, Qinghong Wang, Xiaoyue Zhao:
A Note on Additive Bases of Abelian Groups of Rank 2. 24 - Paul Becker, Thomas R. Cameron, Derek Hanely, Boon Ong, Joseph P. Previte:
On the Number of Minimal Forts of a Graph. 25 - Pierre Ille, Soufiane Lakhlifi:
When a Decomposable Tournament is -1,3-Reconstructible? 26 - David James, Elisha Kahan, Erik Rauer:
ℛ(K6-e,K4) =30 *. 27 - Rui Li, Jinfeng Li, Di Wu:
Optimal Chromatic Bound for ($P_3\cup P_2$, House)-Free Graphs. 28 - Qiming Hu, Baogang Xu:
Maximum Bisections of Graphs Without Adjacent Quadrilaterals. 29 - Meng Liu, Bangwei Du:
Ramsey Numbers of Complete Bipartite Graphs. 30 - Wenjuan Zhou, Rong-Xia Hao, Zhen He, Jaeun Lee:
An infinite family of snarks with perfect matching cover index 4. 31 - Ummul Aymen, James Della-Giustina, Lindsey-Kay Lauderdale, Jason Riley, Erin Stales, Jay Zimmerman:
On the Fixing Sets of Finite Groups. 32 - Hoi Ping Luk, Min Yan:
Angle Combinations in Tilings of the Sphere by Angle Congruent Pentagons. 33 - Mathilde Bouvel, Luca S. Ferrari, Bridget Eileen Tenner:
Between Weak and Bruhat: The Middle Order on Permutations. 34 - Haruko Okamura:
2-Reducible Two Paths and Two Edges Constructing a Cycle in (2k+1)-Edge-Connected Graphs. 35
Volume 41, Number 2, April 2025
- Yan Wang:
Improved Bound for Hadwiger's Conjecture. 36 - Shiyu Cao, Jing Chen, Wei Zheng:
The Structure of Minimally 1-Tough Graphs with Small Independence Number. 37 - Érika Roldán, Rosemberg Toalá-Enríquez:
Isoperimetric Formulas for Hyperbolic Animals. 38 - C. U. Angeliya, Sheshayya A. Choudum, Mayamma Joseph:
Towards Optimal χ-Binding Functions of ($2K_1 \cup K_2$)-Free Graphs and ($P_3 \cup K_1$)-Free Graphs. 39 - Stanislav Jendrol', Alfred Onderko:
A Note on the Facial Edge-Coloring Conjecture. 40 - Hongzhang Chen, Jianxi Li, Shou-Jun Xu:
Two Variants of Toughness of a Graph and its Eigenvalues. 41 - Tim Boykett, Po-Yi Huang, Wen-Fong Ke, Hubert Kiechle, Günter F. Pilz:
Intersection Numbers of Certain 2-Designs from Finite Fields. 42 - Xinyuan Hu, Shao-Fei Du:
Regular Hypermaps with the Automorphism Group $\hbox {PSL}(3,p)$. 43 - Ayman El Zein:
A Note on Sullivan's Second Neighborhood Conjecture. 44 - Breeann Flesch, Jessica Kawana, Joshua D. Laison, Dana Lapides, Stephanie Partlow, Gregory J. Puleo:
Veto Interval Graphs and Variations. 45 - Lin Yang, Sheng-Liang Yang:
A Chung-Feller Property of the Motzkin Paths of Higher Order. 46 - Ruben Ascoli, Livia Betti, Justin Cheigh, Alex Iosevich, Ryan Jeong, Xuyan Liu, Brian McDonald, Wyatt Milgrim, Steven J. Miller, Francisco Romero Acosta, Santiago Velazquez Iannuzzelli:
VC-Dimension of Hyperplanes Over Finite Fields. 47 - Diego Caudillo, Joscha Diehl, Kurusch Ebrahimi-Fard, Emanuele Verri:
Graph Profiles as Characters on Bicommutative Hopf Algebras. 48 - Xiaomeng Wang, Shou-Jun Xu, Sanming Zhou:
Stability of Graph Pairs Involving Cycles. 49 - Masaaki Harada, Hadi Kharaghani:
Unbiased Hadamard Matrices and Ternary Self-dual Codes. 50 - Zhidan Luo:
Extremal Graphs for the Union of Two Vertex-Disjoint Cliques. 51 - Wiam Belkouche, Abderrahim Boussaïri, Soufiane Lakhlifi:
Diamonds and 4-uniform hypergraphs. 52 - Jesper M. Møller:
Euler Characteristics of p-Coset Posets of Finite Groups. 53
Volume 41, Number 3, June 2025
- Jan Florek:
On Dirac and Motzkin Problem in Discrete Geometry. 54 - Mikio Kano, Hajime Matsumura:
Odd-Even Factors of Graphs. 55 - Veronika Furst, John Hutchens, Lon H. Mitchell, Yaqi Zhang:
Compatible Forts and Maximum Nullity of a Graph. 56 - Gabriela Araujo-Pardo, Zhanar Berikkyzy, Linda M. Lesniak:
On the Existence of (r,g,χ )-Cages. 57 - Benjamin Eisley, Koji Matsushita, Andrés R. Vindas-Meléndez:
Matching Polytopes, Gorensteinness, and the Integer Decomposition Property. 58 - Amitayu Banerjee, Zalán Molnár, Alexa Gopaulsingh:
Upper Bounds for the List-Distinguishing Chromatic Number. 59 - Julien Bensmail, Thomas Filasto, Hervé Hocquard, Clara Marcille:
Irregularity Notions for Digraphs. 60 - Fang Tian, Yu-Qin Sun, Zi-Long Liu:
Large Induced Distance Matchings in Certain Sparse Random Graphs. 61 - Andrew Haviland, Stephen P. Humphries:
Difference Sets Disjoint from a Subgroup IV: The Skew Relative Cases with Added Symmetry. 62 - Zijian Deng, Caibing Chang:
On the structure of some classes of $(P_{2}\cup P_{3})$-free graphs. 63 - Michaela Borzechowski, Simon Weber:
On Flipping Edge Sets in Unique Sink Orientations. 64 - Hamid Abchir, Khaled Qazaqzeh, Mohammed Sabak:
A New Polynomial for Checkerboard-Colorable 4-Valent Virtual Graphs. 65 - Shaofei Du, Wenjuan Luo, Hao Yu:
On Hamilton Paths in Vertex-Transitive Graphs of Order 10p. 66 - Isaac Echols, Jon Harrison, Tori Hudgins:
Periodic Orbits on 2-Regular Circulant Digraphs. 67 - George Peterzil, Johanna Steinmeyer:
Set Systems with Covering Properties and Low VC-Dimension. 68 - Vadim E. Levit, David Tankus:
Recognizing Relating Edges in Graphs Without Cycles of Length 6. 69
Volume 41, Number 4, August 2025
- Baoxin Li, Yahan Cao, Shengjin Ji:
The Extremal Results for Forcing Problem of Trees. 70
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-06-13 18:54 CEST 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:
