default search action
Graphs 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 - 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
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.