default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDGraphs and Combinatorics, Volume 29
Volume 29, Number 1, January 2013
- Xueliang Li, Yongtang Shi
, Yuefang Sun:
Rainbow Connections of Graphs: A Survey. 1-38 - Patrick Bahls, T. Scott Spencer:
On the Ramsey Numbers of Trees with Small Diameter. 39-44 - L. Sunil Chandran, Mathew C. Francis, Naveen Sivadasan:
Cubicity and Bandwidth. 45-69 - Peter Dukes, Jared Howell:
The Orthogonality Spectrum for Latin Squares of Different Orders. 71-78 - Michitaka Furuya, Masanori Takatou:
Upper Bound on the Diameter of a Domination Dot-Critical Graph. 79-85 - Mohsen Ghasemi, Jin-Xin Zhou:
Tetravalent s-Transitive Graphs of Order 4p 2. 87-97 - Nicolas Lichiardopol:
New Ore's Type Results on Hamiltonicity and Existence of Paths of Given Length in Graphs. 99-104 - Hongliang Lu, Yunjian Wu, Yuqing Lin, Qinglin Yu, Camino Balbuena, Xavier Marcote:
On Superconnectivity of (4, g)-Cages. 105-119 - Stefko Miklavic:
On Bipartite Distance-Regular Graphs with Intersection Numbers c i = (q i - 1)/(q - 1). 121-130 - Sabrina X. M. Pang, Lun Lv:
A Refinement of Leaves on Noncrossing Trees. 131-143 - Hongtao Zhao, Qingde Kang:
Large Sets of Hamilton Cycle and Path Decompositions of Complete Bipartite Graphs. 145-155
Volume 29, Number 2, March 2013
- Saieed Akbari, Maryam Ghanbari, Raoufeh Manaviyat, Sanaz Zare:
On the Lucky Choice Number of Graphs. 157-163 - Zbigniew R. Bogdanowicz:
Arc-Disjoint and Edge-Disjoint Hamilton Cycles in Circulants with Two Jumps. 165-171 - Daniel Daly:
Reduced Decompositions with One Repetition and Permutation Pattern Avoidance. 173-185 - Alexander A. Davydov, Massimo Giulietti, Stefano Marcugini, Fernanda Pambianco:
Some Combinatorial Aspects of Constructing Bipartite-Graph Codes. 187-212 - Tínaz Ekim, John Gimbel:
Some Defective Parameters in Graphs. 213-224 - Michael Goff:
Simplicial Girth and Pure Resolutions. 225-240 - Yahya Ould Hamidoune, Anna S. Lladó, Susana-Clara López:
On Vosperian and Superconnected Vertex-Transitive Digraphs. 241-251 - Ralf Köhl, Katja Möser, Hendrik Van Maldeghem:
The Endomorphism Type of Certain Bipartite Graphs and a Characterization of Projective Planes. 253-257 - Vadim E. Levit, Eugen Mandrescu:
The Cyclomatic Number of a Graph and its Independence Polynomial at -1. 259-273 - Xiangwen Li, Chunxiang Wang, Qiong Fan, Zhaohong Niu, Liming Xiong:
Spanning Eulerian Subgraphs of 2-Edge-Connected Graphs. 275-280 - Bolian Liu, Muhuo Liu, Zhifu You:
The Majorization Theorem for Signless Laplacian Spectral Radii of Connected Graphs. 281-287 - Katsuhiro Ota, Gabriel Sueiro:
Forbidden Induced Subgraphs for Perfect Matchings. 289-299 - Tay-Woei Shyu:
Decomposition of Complete Graphs into Cycles and Stars. 301-313
Volume 29, Number 3, May 2013
- Atif A. Abueida, Mike Daven:
Multidecompositions of Several Graph Products. 315-326 - Saieed Akbari, Mahdad Khatirinejad, Sahar Qajar:
A Note on the Roman Bondage Number of Planar Graphs. 327-331 - David Auger, Iiro S. Honkala:
Watching Systems in the King Grid. 333-347 - Dejan Brcanov, Vojislav Petrovic, Miroslav Treml:
Kings in Hypertournaments. 349-357 - Arthur H. Busch, Michael S. Jacobson, Timothy Morris, Michael Plantholt, Shailesh K. Tipnis:
Improved Sufficient Conditions for the Existence of Anti-Directed Hamiltonian Cycles in Digraphs. 359-364 - Jakub Cerný, Jan Kyncl, Géza Tóth:
Improvement on the Decay of Crossing Numbers. 365-371 - Hongyu Chen, Xiang Tan, Jianliang Wu, Guojun Li:
The Linear Arboricity of Planar Graphs without 5-, 6-Cycles with Chords. 373-385 - Jeong-Ok Choi, John P. Georges, David W. Mauro:
On Zero-Sum $${\mathbb{Z}_k}$$ -Magic Labelings of 3-Regular Graphs. 387-398 - Antonio Cossidente, Tim Penttila:
Two-Character Sets Arising from Gluings of Orbits. 399-406 - Adam Doss, Dan Saracino, Donald L. Vestal Jr.:
An Excursion into Nonlinear Ramsey Theory. 407-415 - Louis Esperet, Gwenaël Joret:
Boxicity of Graphs on Surfaces. 417-427 - Ralph J. Faudree, Ronald J. Gould:
Saturation Numbers for Nearly Complete Graphs. 429-448 - Lihua Feng, Weijun Liu, Aleksandar Ilic, Guihai Yu:
Degree Distance of Unicyclic Graphs with Given Matching Number. 449-462 - Florent Foucaud, Reza Naserasr, Aline Parreau:
Characterizing Extremal Digraphs for Identifying Codes and Extremal Cases of Bondy's Theorem on Induced Subsets. 463-473 - Jean-Luc Fouquet, Jean-Marie Vanherpe:
On Parsimonious Edge-Colouring of Graphs with Maximum Degree Three. 475-487 - Dániel Gerbner, Nathan Lemons, Cory Palmer, Dömötör Pálvölgyi, Balázs Patkós, Vajk Szécsi:
Almost Cross-Intersecting and Almost Cross-Sperner Pairs of Families of Sets. 489-498 - Martin Charles Golumbic, Bernard Ries:
On the Intersection Graphs of Orthogonal Line Segments in the Plane: Characterizations of Some Subclasses of Chordal Graphs. 499-517 - Bert L. Hartnell, Douglas F. Rall:
On Graphs Having Maximal Independent Sets of Exactly t Distinct Cardinalities. 519-525 - Nader Jafari Rad, Lutz Volkmann:
Roman Domination Dot-critical Graphs. 527-533 - Gyula Y. Katona, Nándor Sieben:
Bounds on the Rubbling and Optimal Rubbling Numbers of Graphs. 535-551 - Sulamita Klein, Célia Picinin de Mello, Aurora Morgana:
Recognizing Well Covered Graphs of Families with Special P 4-Components. 553-567 - István Kovács:
Arc-transitive Dihedrants of Odd Prime-power Order. 569-583 - Hong-Jian Lai, G. R. Omidi, Ghaffar Raeisi:
On Group Choosability of Total Graphs. 585-597 - Mingchu Li, Lifeng Yuan, He Jiang, Bing Liu, Haitze J. Broersma:
Tank-Ring Factors in Supereulerian Claw-Free Graphs. 599-608 - Martín Matamala, José Zamora:
Nowhere-Zero 5-Flows and Even (1, 2)-Factors. 609-616 - Tetsushi Matsui:
Ehrhart Series for Connected Simple Graphs. 617-635 - Nishali Mehta, Ákos Seress:
Bounded Degree, Triangle Avoidance Graph Games. 637-660 - Hong-Xia Niu, Jian-Sheng Cai:
Linear 2-Arboricity of Planar Graphs with Neither 3-Cycles Nor Adjacent 4-Cycles. 661-667 - Geoffrey Pearce, Cheryl E. Praeger:
Rank 3 Transitive Decompositions of Complete Multipartite Graphs. 669-680 - Yuejian Peng, Cheng Zhao:
A Motzkin-Straus Type Result for 3-Uniform Hypergraphs. 681-694 - Yuejian Peng, Papa A. Sissokho:
The Feasible Matching Problem. 695-704 - Iztok Peterin:
Intervals and Convex Sets in Strong Product of Graphs. 705-714 - Kazuhiro Suzuki:
A Generalization of Heterochromatic Graphs and f-Chromatic Spanning Forests. 715-727
Volume 29, Number 4, July 2013
- Susan A. van Aardt, Alewyn P. Burger, Marietjie Frick:
An Infinite Family of Planar Hypohamiltonian Oriented Graphs. 729-733 - Arash Ahadi, Nazli Besharati, Ebadollah S. Mahmoodian, M. Mortezaeefar:
Silver Block Intersection Graphs of Steiner 2-Designs. 735-746 - M. Amin Bahmanian, C. A. Rodger:
Embedding an Edge-colored K(a (p); λ, μ) into a Hamiltonian Decomposition of K(a (p+r); λ, μ). 747-755 - Andrew Beveridge, Meng Wang:
Exact Mixing Times for Random Walks on Trees. 757-772 - L. Sunil Chandran, Rajesh Hemant Chitnis, Ramanjit Kumar:
On the SIG-Dimension of Trees Under the L ∞-Metric. 773-794 - Phong Châu:
An Ore-Type Theorem on Hamiltonian Square Cycles. 795-834 - Eddie Cheng, László Lipták, Ke Qiu, Zhizhang Shen:
Cyclic Vertex-Connectivity of Cayley Graphs Generated by Transposition Trees. 835-841 - Yoshimi Egawa, Michitaka Furuya, Masanori Takatou:
Upper Bounds on the Paired Domination Subdivision Number of a Graph. 843-856 - Richard Ehrenborg, Gábor Hetyei, Margaret A. Readdy:
Level Eulerian Posets. 857-882 - Giorgio Faina, Cristiano Parrettini, Fabio Pasticci:
Embedding 1-Factorizations of K n in PG(2, 32). 883-892 - S. Francis Raj:
Connectivity of the Generalised Mycielskian of Digraphs. 893-900 - Futaba Fujie-Okamoto, Ryan C. Jones, Kyle Kolasinski, Ping Zhang:
On Modular Edge-Graceful Graphs. 901-912 - Hortensia Galeana-Sánchez, Rocío Sánchez-López:
H-Kernels in Infinite Digraphs. 913-920 - Mike J. Grannell, Martin Knor:
Dihedral Biembeddings and Triangulations by Complete and Complete Tripartite Graphs. 921-932 - Suresh Manjanath Hegde, Shivarajkumar:
Two Conjectures on Graceful Digraphs. 933-954 - David S. Herscovici, Benjamin D. Hester, Glenn H. Hurlbert:
t-Pebbling and Extensions. 955-975 - Arthur Hoffmann-Ostenhof:
A Note on 5-Cycle Double Covers. 977-979 - Vít Jelínek, Eva Jelínková, Jan Kratochvíl, Bernard Lidický, Marek Tesar, Tomás Vyskocil:
The Planar Slope Number of Planar Partial 3-Trees of Bounded Degree. 981-1005 - Qingde Kang, Mingchao Li, Jingjing Huo:
Nonisomorphic Maximum Packing and Minimum Covering of K v with 8-Cycles. 1007-1040 - Arnfried Kemnitz, Massimiliano Marangio, Zsolt Tuza:
$$[1, 1, t]$$ -Colorings of Complete Graphs. 1041-1050 - Mekkia Kouider, Saliha Ouatiki:
Sufficient Condition for the Existence of an Even [a, b]-Factor in Graph. 1051-1057 - Liangchen Li, Xiangwen Li, Chi Shu:
Group Connectivity of Bridged Graphs. 1059-1066 - Janina Müttel, Dieter Rautenbach, Friedrich Regen, Thomas Sasse:
On the Cycle Spectrum of Cubic Hamiltonian Graphs. 1067-1076 - Haruko Okamura, Tomoki Yamashita:
Degree Sum Conditions for Cyclability in Bipartite Graphs. 1077-1085 - Zhi-Hong Sun:
Some Inversion Formulas and Formulas for Stirling Numbers. 1087-1100 - Gurusamy Rengasamy Vijayakumar:
Some Results on Weighted Graphs without Induced Cycles of Nonpositive Weights. 1101-1111 - Weifan Wang, Yiqiao Wang:
Linear Coloring of Planar Graphs Without 4-Cycles. 1113-1124 - Yunjian Wu, Nader Jafari Rad:
Bounds on the 2-Rainbow Domination Number of Graphs. 1125-1133 - Baoyindureng Wu, Xingchao Deng, Xinhui An, Guiying Yan:
A Note on Semi-coloring of Graphs. 1135-1140 - Qingsong Zou, Guojun Li, Yunshu Gao:
Every Cycle-Connected Multipartite Tournament with δ ≥ 2 Contains At Least Two Universal Arcs. 1141-1149
Volume 29, Number 5, September 2013
- Monther R. Alfuraidan:
Bipartite Distance-Transitive Doubles with Primitive Halved of Diameter Two. 1151-1174 - Saeid Alikhani:
The Domination Polynomial of a Graph at -1. 1175-1181 - Csaba Biró, Zoltán Füredi, Sogol Jahanbekam:
Large Chromatic Number and Ramsey Graphs. 1183-1191 - Izak Broere, Johannes Heidema:
Universal H-Colourable Graphs. 1193-1206 - Javier Cano, José Miguel Díaz-Báñez, Clemens Huemer, Jorge Urrutia:
The Edge Rotation Graph. 1207-1219 - Jean Cardinal, Hiro Ito, Matias Korman, Stefan Langerman:
Helly Numbers of Polyominoes. 1221-1234 - Lily Chen, Xueliang Li, Huishu Lian:
Nordhaus-Gaddum-Type Theorem for Rainbow Connection Number of Graphs. 1235-1247 - Xiaodan Chen, Jianguo Qian:
Laplacian Spectral Radius and Maximum Degree of Trees with Perfect Matchings. 1249-1257 - Xiaodong Chen, Mingchu Li, Xin Ma, Xinxin Fan:
Hamiltonian Connectedness in Claw-Free Graphs. 1259-1267 - Andrzej Dudek, Oleg Pikhurko, Andrew Thomason:
On Minimum Saturated Matrices. 1269-1286 - Paolo Dulio, Virgilio Pannone:
Iterated Joining of Rooted Trees. 1287-1304 - Tomasz Dzido:
A Note on Turán Numbers for Even Wheels. 1305-1309 - Reinhardt Euler, Tudor Zamfirescu:
On Planar Toeplitz Graphs. 1311-1327 - Evelyne Flandrin, Antoni Marczyk, Jakub Przybylo, Jean-François Saclé, Mariusz Wozniak:
Neighbor Sum Distinguishing Index. 1329-1336 - Yunshu Gao, Guojun Li, Jin Yan:
Neighborhood Unions for the Existence of Disjoint Chorded Cycles in Graphs. 1337-1345 - Jesús García-López, Carlos M. Nicolás:
Planar Point Sets With Large Minimum Convex Decompositions. 1347-1353 - Dániel Gerbner, Balázs Keszegh, Nathan Lemons, Cory Palmer, Dömötör Pálvölgyi, Balázs Patkós:
Saturating Sperner Families. 1355-1364 - Salman Ghazal:
A Contribution to the Second Neighborhood Problem. 1365-1375 - Ebrahim Ghorbani:
Graphs With Few Matching Roots. 1377-1389 - Alexander Halperin, Colton Magnant, Daniel M. Martin:
On Distance Between Graphs. 1391-1402 - Aleksandar Ilic, Milovan Ilic:
Generalizations of Wiener Polarity Index and Terminal Wiener Index. 1403-1416 - Kaveh Khoshkhah, M. Nemati, Hossein Soltani, Manouchehr Zaker:
A Study of Monopolies in Graphs. 1417-1427 - Khee Meng Koh, Zi-Xia Song:
On the Size of Graphs of Class 2 Whose Cores have Maximum Degree Two. 1429-1441 - Khee Meng Koh, Zeinab Maleki, Behnaz Omoomi:
An Upper Bound for the Total Restrained Domination Number of Graphs. 1443-1452 - Vadim E. Levit, Eugen Mandrescu:
When is G 2 a König-Egerváry Graph? 1453-1458 - Hao Li, Junqing Cai, Wantao Ning:
An Implicit Degree Condition for Pancyclicity of Graphs. 1459-1469 - Xueliang Li, Yongtang Shi:
Rainbow Connection in 3-Connected Graphs. 1471-1475 - Hongjuan Liu, Lidong Wang:
Super-Simple Resolvable Balanced Incomplete Block Designs with Block Size 4 and Index 4. 1477-1488 - T. H. Marshall:
Homomorphism Bounds for Oriented Planar Graphs of Given Minimum Girth. 1489-1499 - Zhaoping Meng, Beiliang Du:
The Existence of Augmented Resolvable Candelabra Quadruple Systems with Three Even Groups. 1501-1516 - Juan José Montellano-Ballesteros, Eduardo Rivera-Campo:
On the Heterochromatic Number of Hypergraphs Associated to Geometric Graphs and to Matroids. 1517-1522 - Muhammad Faisal Nadeem, Ayesha Shabbir, Tudor Zamfirescu:
Planar Lattice Graphs with Gallai's Property. 1523-1529 - Zh. G. Nikoghosyan:
Advanced Lower Bounds for the Circumference. 1531-1541 - Yoshio Sano:
A Generalization of Opsut's Lower Bounds for the Competition Number of a Graph. 1543-1547 - Brian C. Wagner:
Ascending Subgraph Decompositions in Oriented Complete Balanced Tripartite Graphs. 1549-1555 - Chengmin Wang, Charles J. Colbourn:
The Existence of (K 2 × K 6)-Designs. 1557-1567 - Wei Wang, Zhidan Yan:
On the Edge Connectivity of Direct Products with Dense Graphs. 1569-1575
Volume 29, Number 6, November 2013
- Oswin Aichholzer, Thomas Hackl, David Orden, Pedro Ramos, Günter Rote, André Schulz, Bettina Speckmann:
Flip Graphs of Bounded Degree Triangulations. 1577-1593 - John Ballantyne, Nicholas Greer, Peter Rowley:
On Coprimality Graphs for Symmetric Groups. 1595-1622 - Crevel Bautista-Santiago, Marco A. Heredia, Clemens Huemer, Adriana Ramírez-Vigueras, Carlos Seara, Jorge Urrutia:
On the Number of Edges in Geometric Graphs Without Empty Triangles. 1623-1631 - Paymun Bayati, Marius Somodi:
On the Ihara Zeta Function of Cones Over Regular Graphs. 1633-1646 - Zbigniew R. Bogdanowicz:
On Family of Graphs with Minimum Number of Spanning Trees. 1647-1652 - Houcine Bouchaala, Youssef Boudabbous, Mohamed Baka Elayech:
Finite Tournaments with a Nonempty Diamonds' Support. 1653-1673 - Alexandre Boulch, Éric Colin de Verdière, Atsuhiro Nakamoto:
Irreducible Triangulations of Surfaces with Boundary. 1675-1688 - Timothy Brauch, Paul Horn, Adam S. Jobson, D. Jacob Wildstrom:
Stack Domination Density. 1689-1711 - C. N. Campos, Simone Dantas, Célia Picinin de Mello:
Colouring Clique-Hypergraphs of Circulant Graphs. 1713-1720 - Ye Chen, Zhi-Hong Chen, Hong-Jian Lai, Ping Li, Erling Wei:
On Spanning Disjoint Paths in Line Graphs. 1721-1731 - Jiuying Dong, Xueliang Li:
Rainbow Connection Number, Bridges and Radius. 1733-1739 - Radoslav Fulek, Balázs Keszegh, Filip Moric, Igor Uljarevic:
On Polygons Excluding Point Sets. 1741-1753 - Zhiquan Hu, Houyuan Lin:
Two Forbidden Subgraph Pairs for Hamiltonicity of 3-Connected Graphs. 1755-1775 - Shenwei Huang, Liying Kang, Erfang Shan:
Paired-Domination in Claw-Free Graphs. 1777-1794 - Jing Jiang, Dianhua Wu, Moon Ho Lee:
Some Infinite Classes of Optimal (v, {3, 4}, 1, Q)-OOCs with $${Q \in \{(\frac {1}{3}, \frac {2}{3}), (\frac {2}{3}, \frac{1}{3})\}}$$. 1795-1811 - Serkan Kader, Bahadir Özgür Güler:
On Suborbital Graphs for the Extended Modular Group $${\hat{\Gamma}}$$. 1813-1825 - Melissa S. Keranen, Sibel Özkan:
The Hamilton-Waterloo Problem with 4-Cycles and a Single Factor of n-Cycles. 1827-1837 - Markus Kuba, Alois Panholzer:
A Unifying Approach for Proving Hook-Length Formulas for Weighted Tree Families. 1839-1865 - Vadim E. Levit, Eugen Mandrescu:
On Unicyclic Graphs with Uniquely Restricted Maximum Matchings. 1867-1879 - Xiang-Jun Li, Jun-Ming Xu:
The Signed Edge-Domatic Number of a Graph. 1881-1890 - Liangchen Li, Xiangwen Li:
Neighborhood Unions and Z 3-Connectivity in Graphs. 1891-1898 - Rong Luo, Zhengke Miao, Rui Xu:
Nowhere-Zero 3-Flows of Graphs with Independence Number Two. 1899-1907 - Zeling Shao, Yanpei Liu, Zhiguo Li:
On the Number of Genus Embeddings of Complete Bipartite Graphs. 1909-1919 - Ioan Tomescu, Sana Javed:
On the Chromaticity of Quasi Linear Hypergraphs. 1921-1926 - Mykhaylo Tyomkyn, Andrew J. Uzzell:
A Turán-Type Problem on Distances in Graphs. 1927-1942 - Le Anh Vinh:
The Number of Occurrences of a Fixed Spread among n Directions in Vector Spaces over Finite Fields. 1943-1949 - Brian C. Wagner:
Ascending Subgraph Decompositions of Tournaments of Order 6n + 3. 1951-1959 - Changping Wang:
The Signed k-Submatchings in Graphs. 1961-1971 - Jichang Wu, Jianping Ou:
On Edge Cut of Graphs Leaving Components of Order at Least Five. 1973-1981 - Rui Xu:
Two Equivalent Properties of $$\mathcal{Z}_3$$ -Connectivity. 1983-1987 - Bao-Xuan Zhu:
The Algebraic Connectivity of Graphs with Given Matching Number. 1989-1995
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-12-17 21:05 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:
