default search action
Graphs and Combinatorics, Volume 32
Volume 32, Number 1, January 2016
- Ron Aharoni, János Barát
, Ian M. Wanless:
Multipartite Hypergraphs Achieving Equality in Ryser's Conjecture. 1-15 - Marzieh Amooshahi, Bijan Taeri:
On Cayley Sum Graphs of Non-Abelian Groups. 17-29 - Amanda Cameron, Dillon Mayhew
Excluded Minors for Matroids Satisfying Kinser's Inequalities. 31-47 - Yair Caro, Raphael Yuster:
On Zero-Sum and Almost Zero-Sum Subgraphs Over ℤ. 49-63 - Fugang Chao, Han Ren, Ni Cao:
Finding Shorter Cycles in a Weighted Graph. 65-77 - Mustapha Chellali, Teresa W. Haynes, Sandra Mitchell Hedetniemi, Stephen T. Hedetniemi, Alice A. McRae:
A Roman Domination Chain. 79-92 - Jonas Eckert, Felix Joos, Dieter Rautenbach:
The Cycle Spectrum of Claw-free Hamiltonian Graphs. 93-101 - Yoshimi Egawa, Mikio Kano, Zheng Yan:
(1, f)-Factors of Graphs with Odd Property. 103-110 - Mark N. Ellingham, Emily Abernethy Marshall:
Criticality of Counterexamples to Toroidal Edge-Hamiltonicity. 111-121 - Hortensia Galeana-Sánchez, Mika Olsen
CKI-Digraphs, Generalized Sums and Partitions of Digraphs. 123-131 - Gary Gordon, Jennifer McNulty, Nancy Ann Neudauer:
Fixing Numbers for Matroids. 133-146 - Terry S. Griggs, Thomas A. McCourt:
Biembeddings of Symmetric n-Cycle Systems. 147-160 - Annika Heckel, Oliver Riordan:
On the threshold for rainbow connection number r in random graphs. 161-174 - Michael A. Henning, Lutz Volkmann:
Signed Roman k-Domination in Graphs. 175-190 - Hsiang-Chun Hsu, Gerard Jennhwa Chang
Max-Coloring of Vertex-Weighted Graphs. 191-198 - Shanmugasundaram Jeevadoss, Appu Muthusamy:
Decomposition of Product Graphs into Paths and Cycles of Length Four. 199-223 - Viktória E. Kaszanitzky, Csaba Király
On Minimally Highly Vertex-Redundantly Rigid Graphs. 225-240 - Jaromy Kuhl, Michael W. Schroeder:
Completing Partial Latin Squares with Blocks of Non-empty Cells. 241-256 - Imre Leader, Ta Sheng Tan
Connected Colourings of Complete Graphs and Hypergraphs. 257-269 - Hongchuan Lei, Hung-Lin Fu:
The Hamilton-Waterloo Problem for Triangle-Factors and Heptagon-Factors. 271-278 - Binlong Li, Bo Ning
Long Paths and Cycles Passing Through Specified Vertices Under the Average Degree Condition. 279-295 - Yuanyuan Liu:
The Existence Spectrum for Overlarge Sets of Pure Hybrid Triple Systems. 297-310 - Zhengke Miao, Xiaofeng Wang, Cun-Quan Zhang:
Hamilton Circuits and Essential Girth of Claw Free Graphs. 311-321 - Juan José Montellano-Ballesteros
On Heterochromatic Out-directed Spanning Trees in Tournaments. 323-332 - Anita Pasotti
A Generalization of the Problem of Mariusz Meszka. 333-350 - Yuqin Sun, Xingxing Yu:
On a Coloring Conjecture of Hajós. 351-361 - Fan Wang, Heping Zhang
Small Matchings Extend to Hamiltonian Cycles in Hypercubes. 363-376 - Yan Wang, Chunxiang Wang:
The Existence Problem of k-γt-Critical Graphs. 377-402 - Jesse T. Williams, Xiangqian Zhou:
A New Proof for a Result of Kingan and Lemos'. 403-417 - Fan Yang, Xiangwen Li, Liangchen Li:
Z3-Connectivity with Independent Number 2. 419-429
Volume 32, Number 2, March 2016
- Oswin Aichholzer
Geometric Achromatic and Pseudoachromatic Indices. 431-451 - Maria Axenovich, Enrica Cherubini, Torsten Ueckerdt:
Spectrum of Mixed Bi-uniform Hypergraphs. 453-461 - Leah Wrenn Berman
Uniquely Tree-saturated Graphs. 463-494 - Benjamin Bond:
EKR Sets for Large n and r. 495-510 - Csilla Bujtás
Improved Upper Bounds on the Domination Number of Graphs With Minimum Degree at Least Five. 511-519 - Marco Buratti, Peter Danziger:
A Cyclic Solution for an Infinite Class of Hamilton-Waterloo Problems. 521-531 - Carl Johan Casselgren, Roland Häggkvist:
Coloring Complete and Complete Bipartite Graphs from Random Lists. 533-542 - Nicholas J. Cavenagh, Vaipuna Raass:
Critical Sets of Full n-Latin Squares. 543-552 - Zhi-Hong Chen:
A Twelve Vertex Theorem for 3-Connected Claw-Free Graphs. 553-558 - Yassine Daadaa, Asif Jamshed, Mudassir Shabbir:
Network Decontamination with a Single Agent. 559-581 - Guoli Ding, Stan Dziobiak:
Excluded-Minor Characterization of Apex-Outerplanar Graphs. 583-627 - Hortensia Galeana-Sánchez, Rocío Sánchez-López
Richardson's Theorem in H-coloured Digraphs. 629-638 - David J. Galvin:
Asymptotic Normality of Some Graph Sequences. 639-647 - Shoni Gilboa, Yehuda Roditty:
Anti-Ramsey Numbers of Graphs with Small Connected Components. 649-662 - Marisa Gutierrez, Silvia B. Tondato:
On Models of Directed Path Graphs Non Rooted Directed Path Graphs. 663-684 - Zhiquan Hu, Shunzhe Zhang
Every 3-connected {K1, 3, N1, 2, 3}-free graph is Hamilton-connected. 685-705 - Sogol Jahanbekam
Rainbow Spanning Subgraphs of Small Diameter in Edge-Colored Complete Graphs. 707-712 - Wei Jin, Weijun Liu, Chang Qun Wang:
Finite 2-Geodesic Transitive Abelian Cayley Graphs. 713-720 - Philip Lafrance, Ortrud R. Oellermann, Timothy Pressey:
Generating and Enumerating Digitally Convex Sets of Trees. 721-732 - Binlong Li, Ingo Schiermeyer:
On Star-Wheel Ramsey Numbers. 733-739 - Hao Li, Weihua He
A Note on Edge-Disjoint Hamilton Cycles in Line Graphs. 741-744 - Jesper M. Møller, Gesche Nord:
Chromatic Polynomials of Simplicial Complexes. 745-772 - Suil O
Cubic Graphs with Large Ratio of Independent Domination Number to Domination Number. 773-776 - Jiangmin Pan, Zhaohong Huang:
Edge-Transitive Regular Metacyclic Covers of the Petersen Graph. 777-784 - Teruhisa Sugimoto:
Convex Pentagons for Edge-to-Edge Tiling, III. 785-799 - Jan H. van Vuuren
Edge Criticality in Graph Domination. 801-811 - Brian C. Wagner:
Ascending Subgraph Decompositions of Tournaments of Orders 6n+2 and 6n+1. 813-822 - Jun Yin, Liming Xiong, Haixing Zhao:
Hamiltonian Claw-Free Graphs and o-Heavy Graphs Involving Induced Cycles. 823-833 - Ping Zhao, Kefeng Diao, Fuliang Lu:
More Result on the Smallest One-Realization of a Given Set. 835-850
Volume 32, Number 3, May 2016
- Yves Aubry, Jean-Christophe Godin, Olivier Togni
Free Choosability of Outerplanar Graphs. 851-859 - Csaba Biró, Peter Hamburger, Attila Pór, William T. Trotter:
Forcing Posets with Large Dimension to Contain Large Standard Examples. 861-880 - Emily Chizmar, Colton Magnant, Pouria Salehi Nowbandegani:
Note on Semi-Linkage with Almost Prescribed Lengths in Large Graphs. 881-886 - Peter Czimmermann
Generalisations of Hypomorphisms and Reconstruction of Hypergraphs. 887-901 - Fatih Demirkale
Orthogonal Trades and the Intersection Problem for Orthogonal Arrays. 903-912 - Ted Dobson:
On Isomorphisms of Marušič-Scapellato Graphs. 913-921 - Adrian Dumitrescu, Maarten Löffler, André Schulz, Csaba D. Tóth:
Counting Carambolas. 923-942 - Danny Dyer, Sadegheh Haghshenas, Nabil Shalaby:
Constructing the Spectrum of Packings and Coverings for the Complete Graph with Stars with up to Five Edges. 943-961 - Ralph J. Faudree, Jenö Lehel, Kiyoshi Yoshimoto:
Locating Pairs of Vertices on a Hamiltonian Cycle in Bigraphs. 963-986 - Johannes H. Hattingh, Osama A. Saleh, Lucas C. van der Merwe, Terry J. Walters:
Nordhaus-Gaddum Results for the Induced Path Number of a Graph When Neither the Graph Nor Its Complement Contains Isolates. 987-996 - Mirko Hornák
On the Maximum Weight of a Sparse Connected Graph of Given Order and Size. 997-1012 - Adam King, Amanda Laubmeier, Kai Orans, Anant P. Godbole:
Universal and Overlap Cycles for Posets, Words, and Juggling Patterns. 1013-1025 - Daniel Kotlar
Distance Magic Labeling in Complete 4-partite Graphs. 1027-1038 - Tri Lai:
Generating Function of the Tilings of an Aztec Rectangle with Holes. 1039-1054 - Richard Lang
A Note on Total and List Edge-Colouring of Graphs of Tree-Width 3. 1055-1064 - Yanting Liang, Hong-Jian Lai, Rong Luo, Rui Xu:
Extendability of Contractible Configurations for Nowhere-Zero Flows and Modulo Orientations. 1065-1075 - Yuanyuan Liu:
A Completion of the Spectrum for the Overlarge Sets of Pure Mendelsohn Triple Systems. 1077-1100 - T. H. Marshall:
An Oriented 6-Coloring of Planar Graphs with Girth at Least 9. 1101-1116 - Diogo Kendy Matsumoto, Atsuhiko Mizusawa:
A Construction of Smooth Travel Groupoids on Finite Graphs. 1117-1124 - Bo Ning
Solution to a Problem on Hamiltonicity of Graphs Under Ore- and Fan-Type Heavy Subgraph Conditions. 1125-1135 - Jakub Przybylo, Jens Schreyer, Erika Skrabul'áková
On the Facial Thue Choice Number of Plane Graphs Via Entropy Compression Method. 1137-1153 - Nader Jafari Rad
Edge-Removal and Edge-Addition in α-Domination. 1155-1166 - Mustazee Rahman
Percolation with Small Clusters on Random Graphs. 1167-1185 - Rebecca J. Stones, Sheng Lin, Xiaoguang Liu, Gang Wang:
On Computing the Number of Latin Rectangles. 1187-1202 - Yunfang Tang, Tsai-Lien Wong, Xuding Zhu:
Total Weight Choosability of Cone Graphs. 1203-1216 - Lutz Volkmann:
Signed Roman k-domination in Digraphs. 1217-1227 - Chenxiao Xue, Carl Yerger:
Optimal Pebbling on Grids. 1229-1247
Volume 32, Number 4, July 2016
- József Balogh, John Lenz:
Hypergraphs with Zero Chromatic Threshold. 1249-1262 - Gabriel A. Barragán-Ramírez, Juan A. Rodríguez-Velázquez
The Local Metric Dimension of Strong Product Graphs. 1263-1278 - Adam Bland
Monochromatic Sinks in k-Arc Colored Tournaments. 1279-1291 - Simona Bonvicini
Edge-Colorings of 4-Regular Graphs with the Minimum Number of Palettes. 1293-1311 - Bostjan Bresar, Sandi Klavzar
Packing Chromatic Number of Base-3 Sierpiński Graphs. 1313-1327 - Junqing Cai, Hao Li:
Hamilton Cycles in Implicit 2-Heavy Graphs. 1329-1337 - Konrad Kazimierz Dabrowski, Vadim V. Lozin
Combinatorics and Algorithms for Augmenting Graphs. 1339-1352 - Fatih Demirkale
Difference Covering Arrays and Pseudo-Orthogonal Latin Squares. 1353-1374 - Aras Erzurumluoglu, Christopher A. Rodger:
Fair 1-Factorizations and Fair Holey 1-Factorizations of Complete Multipartite Graphs. 1375-1388 - Manuel Fendler, Daniel Grieser:
A New Simple Proof of the Aztec Diamond Theorem. 1389-1395 - Chin-Mei Fu, Kuo-Ching Huang, Miwako Mishima:
Decomposition of Complete Bipartite Graphs into Cycles of Distinct Even Lengths. 1397-1413 - Yuping Gao, Guanghui Wang, Jian-Liang Wu:
A Relaxed Case on 1-2-3 Conjecture. 1415-1421 - Xijuan Hu, Yanxun Chang, Tao Feng
Group Divisible Packings and Coverings with Any Minimum Leave and Minimum Excess. 1423-1446 - T. Karthick, Frédéric Maffray:
Vizing Bound for the Chromatic Number on Some Graph Classes. 1447-1460 - Seog-Jin Kim, Boram Park:
Coloring of the Square of Kneser Graph K(2k+r, k). 1461-1472 - Zuosong Liang, Erfang Shan, Liying Kang:
Clique-Coloring Claw-Free Graphs. 1473-1488 - Changhong Lu, Chao Wang, Kan Wang:
Upper Bounds for the Paired-Domination Numbers of Graphs. 1489-1494 - Xuanlong Ma
The Rainbow Connection Number of the Power Graph of a Finite Group. 1495-1504 - Reza Naserasr, Sagnik Sen, Qiang Sun:
Walk-Powers and Homomorphism Bounds of Planar Signed Graphs. 1505-1519 - Christos Pelekis:
Bernoulli Trials of Fixed Parity, Random and Randomly Oriented Graphs. 1521-1544 - Peter Rowley, David Ward:
On π-Product Involution Graphs in Symmetric Groups. 1545-1570 - Iwao Sato:
A New Proof of a Formula for the Bartholdi Zeta Function of a Digraph. 1571-1583 - Pranjali Sharma, Mukti Acharya:
Balanced Signed Total Graphs of Commutative Rings. 1585-1597 - Haichao Wang, Erfang Shan, Yancai Zhao:
3-Factor-Criticality in Double Domination Edge Critical Graphs. 1599-1610 - Jingjing Yao, Xiaowei Yu, Guanghui Wang, Changqing Xu:
Neighbor Sum (Set) Distinguishing Total Choosability of d-Degenerate Graphs. 1611-1620 - Jianghua Zhang
Neighbor Sum Distinguishing Index of K4-Minor Free Graphs. 1621-1633 - Huanhua Zhao, Xuding Zhu:
(2+ϵ)-Nonrepetitive List Colouring of Paths. 1635-1640
Volume 32, Number 5, September 2016
- Anna Adamaszek
Lower Bounds for Locally Highly Connected Graphs. 1641-1650 - Méziane Aïder
Relaxed Locally Identifying Coloring of Graphs. 1651-1665 - Omer Angel, Igor Shinkar:
A Tight Upper Bound on Acquaintance Time of Graphs. 1667-1673 - Esther Banaian, Steve Butler, Christopher Cox
Counting Prime Juggling Patterns. 1675-1688 - Michael D. Barrus
Graphs with the Strong Havel-Hakimi Property. 1689-1697 - Douglas Bauer
Vertex Arboricity and Vertex Degrees. 1699-1705 - Julien Bensmail, Gabriel Renault:
Decomposing Oriented Graphs into Six Locally Irregular Oriented Graphs. 1707-1721 - Jason I. Brown
On the Real Roots of σ -Polynomials. 1723-1730 - Gerard J. Chang, Sheng-Hua Chen, Chun-Hung Liu:
Edge Roman Domination on Graphs. 1731-1747 - Herman Z. Q. Chen, Sergey Kitaev
Word-Representability of Face Subdivisions of Triangular Grid Graphs. 1749-1761 - Huiwen Cheng, Mohsen Ghasemi, Sha Qiao:
Tetravalent Vertex-Transitive Graphs of Order Twice A Prime Square. 1763-1771 - Shuya Chiba, Michitaka Furuya, Shoichi Tsuchiya:
Dominating Cycles and Forbidden Pairs Containing P5. 1773-1788 - Aleksandr Yu. Chirkov, Nikolai Yu. Zolotykh
On the Number of Irreducible Points in Polyhedra. 1789-1803 - Zachary Cohn, Anant P. Godbole, Elizabeth Wright Harkness, Yiguang Zhang:
The Number of Seymour Vertices in Random Tournaments and Digraphs. 1805-1816 - Charles B. Crane:
Hamiltonian Type Properties in Claw-Free P5-Free Graphs. 1817-1828 - Jiuying Dong, Xueliang Li:
Rainbow Connection Number and Independence Number of a Graph. 1829-1841 - Adrian W. Dudek
On the Spectrum of the Generalised Petersen Graphs. 1843-1850 - Thibault Espinasse, Paul Rochet:
Relations Between Connected and Self-Avoiding Hikes in Labelled Complete Digraphs. 1851-1871 - Hortensia Galeana-Sánchez, Mika Olsen
A Characterization of Locally Semicomplete CKI-digraphs. 1873-1879 - Rim Ben Hamadou, Youssef Boudabbous
Description of the Tournaments Which are Reconstructible from Their k-cycle Partial Digraphs for k ∈ {3, 4}. 1881-1901 - Guoliang Hao, Jianguo Qian
On the Rainbow Domination Number of Digraphs. 1903-1913 - Takehiro Hasegawa, Seiken Saito:
On graph theory Mertens' theorems. 1915-1930 - Volker Kaibel, Jon Lee, Matthias Walter
Extended Formulations for Independence Polytopes of Regular Matroids. 1931-1944 - William L. Kocay:
A Note on Non-reconstructible 3-Hypergraphs. 1945-1963 - Elena V. Konstantinova
Independent Even Cycles in the Pancake Graph and Greedy Prefix-Reversal Gray Codes. 1965-1978 - Tri Lai:
A Generalization of Aztec Dragons. 1979-1999 - Ruonan Li
Color Degree Sum Conditions for Rainbow Triangles in Edge-Colored Graphs. 2001-2008 - Hongliang Lu, Qinglin Yu:
Generalization of Matching Extensions in Graphs (IV): Closures. 2009-2018 - Rong Luo, Zhengke Miao, Yue Zhao:
Hamiltonian Cycles in Critical Graphs with Large Maximum Degree. 2019-2028 - T. H. Marshall:
P11 P 11 -Coloring of Oriented Graphs. 2029-2045 - Jens Maßberg:
The Union-Closed Sets Conjecture for Small Families. 2047-2051 - Ragnar Nevries, Christian Rosenke:
Towards a Characterization of Leaf Powers by Clique Arrangements. 2053-2077 - Malgorzata Prazmowska, Krzysztof Prazmowski:
Binomial partial Steiner triple systems containing complete graphs. 2079-2092 - Yunior Ramírez-Cruz
The Simultaneous Metric Dimension of Families Composed by Lexicographic Product Graphs. 2093-2120 - M. A. Shalu, T. P. Sandhya
Star Coloring of Graphs with Girth at Least Five. 2121-2134 - Pablo Spiga:
Constructing Half-Arc-Transitive Graphs of Valency Four with Prescribed Vertex Stabilizers. 2135-2144 - Martin Trinks
A Survey on Recurrence Relations for the Independence Polynomial of Hypergraphs. 2145-2158 - H. Yu, D. Wu, Hantao Zhang:
The Existence of Irrational Diagonally Ordered Magic Squares. 2159-2170 - Shaohua Zhang, Jin Yan, Suyun Jiang:
Vertex-Disjoint Cycles Containing Specified Vertices in a Bipartite Graph. 2171-2181 - Roberta Rui Zhou, Wenchang Chu:
Identities on Extended Catalan Numbers and Their q-Analogs. 2183-2197
Volume 32, Number 6, November 2016
- Jesús Alva-Samos, Juan José Montellano-Ballesteros
Rainbow Connection in Some Digraphs. 2199-2209 - Andrew Beveridge, Jeanmarie Youngblood:
The Best Mixing Time for Random Walks on Trees. 2211-2239 - Gilberto Calvillo, David Romero
New Families of n-Clusters Verifying the Erdős-Faber-Lovász Conjecture. 2241-2252 - Zhi-Hong Chen:
Chvátal-Erdös Type Conditions for Hamiltonicity of Claw-Free Graphs. 2253-2266 - Zhi-Hong Chen:
Snarks, Hypohamiltonian Graphs and Non-Supereulerian Graphs. 2267-2273 - Lei Cheng, Jianfeng Hou, Yusheng Li, Qizhong Lin:
Monochromatic Solutions for Multi-Term Unknowns. 2275-2293 - Megan Cream
Chorded Cycles. 2295-2313 - Radoslaw Cymer, Mikio Kano:
Generalizations of Marriage Theorem for Degree Factors. 2315-2322 - Michal Debski
Universal Cycle Packings and Coverings for k-Subsets of an n-Set. 2323-2337 - Vincent Despré, Francis Lazarus:
Some Triangulated Surfaces without Balanced Splitting. 2339-2353 - Suyun Ding, Bo Ling
Arc-Transitive Pentavalent Graphs of Square-Free Order. 2355-2366 - Alejandro Estrada-Moreno
Relationships Between the 2-Metric Dimension and the 2-Adjacency Dimension in the Lexicographic Product of Graphs. 2367-2392 - Sylvain Gravier, Frédéric Maffray, Lucas Pastor:
On the Choosability of Claw-Free Perfect Graphs. 2393-2413 - Zita Helle, Gábor Simonyi:
Orientations Making k-Cycles Cyclic. 2415-2423 - Michael A. Henning, Felix Joos, Christian Löwenstein, Thomas Sasse:
Induced Cycles in Graphs. 2425-2441 - Robert Hochberg, Paul Phillips:
Discrepancy One among Homogeneous Arithmetic Progressions. 2443-2460 - Jonathan Hulgan, Jeno Lehel, Kenta Ozeki
Vertex Coloring of Graphs by Total 2-Weightings. 2461-2471 - Andrea Jiménez
Cubic Bridgeless Graphs and Braces. 2473-2495 - Chaya Keller
On Convex Geometric Graphs with no k + 1 Pairwise Disjoint Edges. 2497-2514 - Ewa M. Kubicka, Grzegorz Kubicki, Maxfield Leidner:
Total Colorings of Graphs with Minimum Sum of Colors. 2515-2524 - Oscar Levin
Computing Planarity in Computable Planar Graphs. 2525-2539 - Binlong Li, Halina Bielak:
On the Ramsey-Goodness of Paths. 2541-2549 - Zuosong Liang, Erfang Shan, Liying Kang:
Clique-Perfectness of Claw-Free Planar Graphs. 2551-2562 - Zhaoping Meng:
Doubly Resolvable H Designs. 2563-2574 - Seongmin Ok, R. Bruce Richter
Liftings in Finite Graphs and Linkages in Infinite Graphs with Prescribed Edge-Connectivity. 2575-2589 - David Pegrímek, Petr Gregor
Hamiltonian Laceability of Hypercubes Without Isometric Subgraphs. 2591-2624 - Alexey E. Rastegin
Notes on use of Generalized Entropies in Counting. 2625-2641
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-12-11 20:33 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: