default search action
Graphs and Combinatorics, Volume 36
Volume 36, Number 1, January 2020
- Alberto Seeger, David Sossa:
Extremal Problems Involving the Two Largest Complementarity Eigenvalues of a Graph. 1-25 - Candida Bowtell, Richard Mycroft:
Classification of Maximum Hittings by Large Families. 27-39 - Nathan Linial, Sria Louis
:
Asymptotically Almost Every 2r-Regular Graph Has an Internal Partition. 41-50 - Naoki Matsumoto, Tomoki Nakamigawa, Tadashi Sakuma
Convex Grabbing Game of the Point Set on the Plane. 51-62 - Richard A. Brualdi, Geir Dahl
Alternating Sign Matrices: Extensions, König-Properties, and Primary Sum-Sequences. 63-92 - Wenqian Zhang
Matching Extendability and Connectivity of Regular Graphs from Eigenvalues. 93-108 - Sandeep Dalal
Chromatic Number of the Cyclic Graph of Infinite Semigroup. 109-113 - Rongquan Feng, Wenqian Zhang
The Edge-Connectivity of Strongly 3-Walk-Regular Graphs. 115-124 - Angèle M. Foley, Dallas J. Fraser, Chính T. Hoàng
The Intersection of Two Vertex Coloring Problems. 125-138 - Ilhan Hacioglu
The Number of Tournaments with the Minimum Number of Upsets. 139-151 - Kevin G. Milans
Online Coloring a Token Graph. 153-165 - Michitaka Furuya
Long Paths in Bipartite Graphs and Path-Bistar Bipartite Ramsey Numbers. 167-176 - Volker Kaibel, Jon Lee, Matthias Walter, Stefan Weltge
Correction to: Extended Formulations for Independence Polytopes of Regular Matroids. 177-179
Volume 36, Number 2, March 2020
- Jin Akiyama, Hiro Ito, Toshinori Sakai, Yushi Uno:
Twenty Years of Progress of ${JCDCG}^3$. 181-203 - Bernardo M. Ábrego, Silvia Fernández-Merchant
The Bipartite-Cylindrical Crossing Number of the Complete Bipartite Graph. 205-220 - Jin Akiyama, Erik D. Demaine, Stefan Langerman
Polyhedral Characterization of Reversible Hinged Dissections. 221-229 - Hugo A. Akitaya
Infinite All-Layers Simple Foldability. 231-244 - Eiichi Bannai, Da Zhao
Spherical Embeddings of Symmetric Association Schemes in 3-Dimensional Euclidean Space. 245-250 - Jeffrey Bosboom
Path Puzzles: Discrete Tomography with a Path Constraint is Hard. 251-267 - Erik D. Demaine, Hiro Ito, Stefan Langerman, Jayson Lynch, Mikhail Rudoy, Kai Xiao
Cookie Clicker. 269-302 - Bernardo M. Ábrego
On the Crossing Number of 2-Page Book Drawings of Kn with Prescribed Number of Edges in Each Page. 303-318 - Takaaki Fujita, Koichi Yamazaki
Tangle and Ultrafilter: Game Theoretical Interpretation. 319-330 - Jin-ichi Itoh, Chie Nara
Continuous Flattening of the 2-Dimensional Skeleton of the Square Faces in a Hypercube. 331-338 - Elena Arseneva, Stefan Langerman:
Which Convex Polyhedra Can Be Made by Gluing Regular Hexagons? 339-345 - Yasuhiko Takenaga
Matchstick Puzzles on a Grid. 347-357 - Kazuki Matsubara, Chie Nara:
Internal Continuous Flattening of Polyhedra. 359-370 - Supanut Chaidee
Laguerre Voronoi Diagram as a Model for Generating the Tessellation Patterns on the Sphere. 371-385 - Robert D. Barish, Akira Suyama:
Counting Hamiltonian Cycles on Quartic 4-Vertex-Connected Planar Graphs. 387-400
Volume 36, Number 3, May 2020
- Bora Moon
Every 4-Equivalenced Association Scheme is Frobenius. 401-414 - John Asplund
${\mathrm{TS}}(v, \lambda )$ with Cyclic 2-Intersecting Gray Codes: v=uiv 0 or 4±od 12. 415-436 - Sebastián Bustamante, Jan Corsten, Nóra Frankl:
Partitioning Infinite Hypergraphs into Few Monochromatic Berge-Paths. 437-444 - Helin Gong, Xian'an Jin, Mengchen Li:
Several Extreme Coefficients of the Tutte Polynomial of Graphs. 445-457 - Neal Bushaw
Forbidding Multiple Copies of Forestable Graphs. 459-467 - Yoshihiro Asayama, Ryo Matsukawa, Naoki Matsumoto, Atsuhiro Nakamoto:
N-Flips in Triangulations with Two Odd Degree Vertices. 469-490 - Alexandr V. Kostochka, Mina Nahvi, Douglas B. West, Dara Zirlin:
Degree Lists and Connectedness are 3-Reconstructible for Graphs with At Least Seven Vertices. 491-501 - Dean Crnkovic
On the $\mathrm{PSU}(4, 2)$-Invariant Vertex-Transitive Strongly Regular (216, 40, 4, 8) Graph. 503-513 - Longqin Wang
Some Multi-Color Ramsey Numbers on Stars versus Path, Cycle or Wheel. 515-524 - Mirela Damian
Spanning Properties of Theta-Theta-6. 525-538 - Eric Ould Dadah Andriantiana
The Average Size of Matchings in Graphs. 539-560 - Hiroaki Hamanaka, Atsuhiro Nakamoto
Rhombus Tilings of an Even-Sided Polygon and Quadrangulations on the Projective Plane. 561-571 - Robert E. L. Aldred
Extendability and Criticality in Matching Theory. 573-589 - Danny Crytser, Natasha Komarov
Containment: A Variation of Cops and Robber. 591-605 - Ayaka Ishikawa
An Explicit Formula Enumerating the Finely Bounded Trees Using Young Tableaux. 607-615 - Israel Aldana-Galván
Tight Bounds for Illuminating and Covering of Orthotrees with Vertex Lights and Vertex Beacons. 617-630 - Peter Borg
Isolation of Cycles. 631-637 - Feifei Song, Shunzhe Zhang
Long Cycles Passing Through a Linear Forest. 639-664 - Zdenek Ryjácek, Petr Vrána, Liming Xiong:
A Note on Singular Edges and Hamiltonicity in Claw-Free Graphs with Locally Disconnected Vertices. 665-677 - Hemanshu Kaul
A Simple Characterization of Proportionally 2-choosable Graphs. 679-687 - Teresa W. Haynes
Trees with Unique Minimum Semitotal Dominating Sets. 689-702 - Alexandr V. Kostochka, Michael Stiebitz
The Minimum Number of Edges in 4-Critical Digraphs of Given Order. 703-718 - Guantao Chen, Yuan Chen
The Chromatic Number of Graphs with No Induced Subdivision of K4. 719-728 - Martin Balko
Almost-Equidistant Sets. 729-754 - Hui Zhu, Liying Kang, Erfang Shan:
Extremal Graphs for Odd-Ballooning of Paths and Cycles. 755-766 - Gen Kawatani, Yusuke Suzuki
Partially Broken Orientations of Eulerian Plane Graphs. 767-777 - Aravind Gollakota, Will Hardt, István Miklós:
Packing Tree Degree Sequences. 779-801 - Ervin Györi, Gyula Y. Katona, László F. Papp:
Optimal Pebbling Number of the Square Grid. 803-829 - Janusz Dybizbanski
2-Edge-Colored Chromatic Number of Grids is at Most 9. 831-837 - Weiguo Zhu, Yongqi Sun
Exact Values of Multicolor Ramsey Numbers $R_l(C_{\le l+1})$. 839-852 - Lan Anh Pham:
On Restricted Colorings of (d, s)-Edge Colorable Graphs. 853-864 - Andrei Pavelescu, Elena Pavelescu:
Hadwiger Numbers of Self-complementary Graphs. 865-876 - Jason I. Brown
Maximum Modulus of Independence Roots of Graphs and Trees. 877-894 - Peter J. Cameron
On the Connectivity and Independence Number of Power Graphs of Groups. 895-904 - Rahul Gangopadhyay, Saswata Shannigrahi:
Rectilinear Crossings in Complete Balanced d-Partite d-Uniform Hypergraphs. 905-911 - Gregory J. Puleo:
Some Results on Multithreshold Graphs. 913-919
Volume 36, Number 4, July 2020
- Matthias Beck, Maryam Farahmand, Gina Karunaratne, Sandra Zuniga Ruiz
Bivariate Order Polynomials. 921-931 - Toshiaki Adachi, Guanyuan Chen:
Regular and Vertex-Transitive Kähler Graphs Having Commutative Principal and Auxiliary Adjacency Operators. 933-958 - Alistaire Everett, Peter Rowley:
Commuting Involution Graphs for 4-Dimensional Projective Symplectic Groups. 959-1000 - Seyed Hassan Alavi
Flag-Transitive Block Designs and Finite Simple Exceptional Groups of Lie Type. 1001-1014 - Bart De Bruyn:
On Near Polygons All Whose Hexes are Dual Polar Spaces. 1015-1041 - Zhiyong Gan
Hamiltonian Cycle Properties in k-Extendable Non-bipartite Graphs with High Connectivity. 1043-1058 - Jessica McDonald, Gregory J. Puleo, Craig Tennenhouse
Packing and Covering Directed Triangles. 1059-1063 - Shuang Zhao, Yingzhi Tian, Jixiang Meng:
Degree Sequence Conditions for Maximally Edge-Connected and Super Edge-Connected Hypergraphs. 1065-1078 - Saieed Akbari
Circular Zero-Sum r-Flows of Regular Graphs. 1079-1092 - Makoto Tagami, Ryota Hori:
Harmonic Index t-Designs in the Hamming Scheme for Arbitrary q. 1093-1109 - Paul Buckingham
p-Adic Roots of Chromatic Polynomials. 1111-1130 - Alberto Seeger:
Repetition of Spectral Radiuses Among Connected Induced Subgraphs. 1131-1144 - Richard A. Brualdi:
Stirling Pairs of Permutations. 1145-1162 - Xihe Li
Gallai-Ramsey Numbers for Rainbow Paths. 1163-1175 - Jie Xue
Unimodality of Principal Eigenvector and its Applications. 1177-1188 - Keaitsuda Maneeruk Nakprasit, Kittikorn Nakprasit
A Generalization of Some Results on List Coloring and DP-Coloring. 1189-1201 - Ce Shi
Consecutive Detecting Arrays for Interaction Faults. 1203-1218 - Matt DeVos, Adam Dyck, Jonathan Jedwab
Which Graphs Occur as γ-Graphs? 1219-1246 - Hortensia Galeana-Sánchez, Rocío Sánchez-López
Richardson's theorem in quasi-transitive and pre-transitive digraphs. 1247-1261 - Milan Pokorný
Comments on "On Integral Graphs Which Belong to the Class øverlineα Ka, b" [Graphs Comb. 19 527-532 (2003)]. 1263-1268
Volume 36, Number 5, September 2020
- In Memoriam Professor Robin Thomas (1962 - 2020). 1269-1271
- Megha Goyal
On q-Series and Split Lattice Paths. 1273-1295 - Hanbaek Lyu:
Chromatic Number, Induced Cycles, and Non-separating Cycles. 1297-1310 - Anthony Bonato, Karen Gunderson, Amy Shaw:
Burning the Plane. 1311-1335 - Gee-Choon Lau
Affirmative Solutions on Local Antimagic Chromatic Number. 1337-1354 - Qingsong Zou
On Vertex-Disjoint Triangles in Tripartite Graphs and Multigraphs. 1355-1361 - Muhuo Liu, Yang Wu
Unified Spectral Hamiltonian Results of Balanced Bipartite Graphs and Complementary Graphs. 1363-1390 - Csilla Bujtás
On Specific Factors in Graphs. 1391-1399 - Steve Butler, Craig Erickson, Shaun M. Fallat, H. Tracy Hall, Brenda Kroschel, Jephian C.-H. Lin
Properties of a q-Analogue of Zero Forcing. 1401-1419 - Steve Butler, Craig Erickson, Shaun M. Fallat, H. Tracy Hall, Brenda Kroschel, Jephian C.-H. Lin
Correction to: Properties of a q-Analogue of Zero Forcing. 1421-1422 - Mengmeng Xie, Chuixiang Zhou
Signed Circuit Cover of Bridgeless Signed Graphs. 1423-1443 - Xiaojing Yang, Liming Xiong:
Forbidden Subgraphs for a Graph to Have a Hamiltonian Path Square. 1445-1456 - Alastair Maxwell, Konrad J. Swanepoel
Shortest Directed Networks in the Plane. 1457-1475 - Iain Beaton
Optimal Domination Polynomials. 1477-1487 - Lin Yang
A Relation Between Schröder Paths and Motzkin Paths. 1489-1502 - Huawen Ma
Maximum Cuts in $\mathscr {H}$-Free Graphs. 1503-1516 - Colton Magnant
On Cycles that Alternate Through Selected Sets of Vertices. 1517-1523 - Jing Shi, Jinhua Wang
On existence of Two Classes of Generalized Howell Designs with Block Size Three and Index Two. 1525-1543 - Donghan Zhang, You Lu, Shenggui Zhang:
Neighbor Sum Distinguishing Total Choosability of Cubic Graphs. 1545-1562 - Thomas Mahoney
An Infinite Family of Sum-Paint Critical Graphs. 1563-1571 - Bo-Jun Yuan, Yi Wang, Shi-Cai Gong, Yun Qiao:
On Mixed Graphs Whose Hermitian Spectral Radii are at Most 2. 1573-1584 - Xiaodong Chen, Qing Ji, Mingda Liu:
Reducing Vizing's 2-Factor Conjecture to Meredith Extension of Critical Graphs. 1585-1591 - Milica Andelic
Laplacian Controllability for Graphs Obtained by Some Standard Products. 1593-1602
Volume 36, Number 6, November 2020
- Xihe Li
Gallai-Ramsey Numbers for a Class of Graphs with Five Vertices. 1603-1618 - Xihe Li, Ligong Wang:
Correction to: Gallai-Ramsey Numbers for a Class of Graphs with Five Vertices. 1619-1622 - Gábor Simonyi
On Colorful Edge Triples in Edge-Colored Complete Graphs. 1623-1637 - Binlong Li:
Bipartite Independent Number and Hamilton-Biconnectedness of Bipartite Graphs. 1639-1653 - Atílio G. Luiz
On 0-Rotatable Graceful Caterpillars. 1655-1673 - Fangfang Wu
Sub-Ramsey Numbers for Matchings. 1675-1685 - Anthony D. Forbes
Group Divisible Designs with Block Size Four and Type gu b1 (gu/2)1. 1687-1703 - Roberta Rui Zhou, Kun Yan, Yihui He, Xinxin Xu:
A Note on Combinatorial Proofs for Extended Touchard's and Extended Koshy's Identities. 1705-1711 - Kieran Clancy
There Are No Cubic Graphs on 26 Vertices with Crossing Number 10 or 11. 1713-1721 - Qing Cui
Partitioning Claw-Free Subcubic Graphs into Two Dominating Sets. 1723-1740 - Annette Karrer, Petra Schwer
The Triangle Groups (2, 4, 5) and (2, 5, 5) are not Systolic. 1741-1782 - Balázs Keszegh
Two-Coloring Triples such that in Each Color Class Every Element is Missed at Least Once. 1783-1795 - Jiaao Li
Spanning Triangle-Trees and Flows of Graphs. 1797-1814 - Carl Feghali
Reconfiguring 10-Colourings of Planar Graphs. 1815-1818 - Aysel Erey
Uniform Length Dominating Sequence Graphs. 1819-1825 - Zhenyu Ni, Liying Kang
Extremal Graphs for Blow-Ups of Keyrings. 1827-1853 - Chassidy Bozeman, Pamela E. Harris
Multi-color Forcing in Graphs. 1855-1868 - Julien Bensmail, François Dross, Nicolas Nisse:
Decomposing Degenerate Graphs into Locally Irregular Subgraphs. 1869-1889 - Grigory Ryabov
Separability of Schur Rings Over Abelian Groups of Odd Order. 1891-1911 - Guowei Dai
P3-Factors in the Square of a Tree. 1913-1925 - Bradley Elliott
On Degree Sum Conditions and Vertex-Disjoint Chorded Cycles. 1927-1945 - András Sebö:
Ear-Slicing for Matchings in Hypergraphs. 1947-1951 - Rogers Mathew
A Combinatorial Proof of Fisher's Inequality. 1953-1956 - Sudip Bera, Sajal Kumar Mukherjee:
Generalized Power Sum and Newton-Girard Identities. 1957-1964
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 2024-11-15 19:21 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: