default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDGraphs and Combinatorics, Volume 30
Volume 30, Number 1, January 2014
- Ronald J. Gould:
Recent Advances on the Hamiltonian Problem: Survey III. 1-46 - Oswin Aichholzer
, Thomas Hackl, Michael Hoffmann, Alexander Pilz, Günter Rote, Bettina Speckmann, Birgit Vogtenhuber:
Plane Graphs with Parity Constraints. 47-69 - Maria Axenovich, JiHyeok Choi, Michelle A. Lastrina, Tracy McKay, J. Smith, Brendon Stanton:
On the Chromatic Number of Subsets of the Euclidean Plane. 71-81 - Isma Bouchemakh, Mohamed Zemir:
On the Broadcast Independence Number of Grid Graph. 83-100 - Travis G. Buck, Anant P. Godbole:
Size-Maximal Symmetric Difference-Free Families of Subsets of [n]. 101-108 - Shubo Chen, Weijun Liu:
Extremal Zagreb Indices of Graphs with a Given Number of Cut Edges. 109-118 - Nancy E. Clarke, Samuel Fiorini, Gwenaël Joret, Dirk Oliver Theis:
A Note on the Cops and Robber Game on Graphs Embedded in Non-Orientable Surfaces. 119-124 - Mirela Damian, Erik D. Demaine, Robin Y. Flatland:
Unfolding Orthogonal Polyhedra with Quadratic Refinement: The Delta-Unfolding Algorithm. 125-140 - Fatih Demirkale, Emine Sule Yazici:
On The Spectrum of Minimal Defining Sets of Full Designs. 141-157 - Roger B. Eggleton, Michal Morayne:
A Note on Counting Homomorphisms of Paths. 159-170 - Richard H. Hammack, Heather C. Smith:
Zero Divisors Among Digraphs. 171-181 - Arnfried Kemnitz, Massimiliano Marangio:
d-strong Edge Colorings of Graphs. 183-195 - Mekkia Kouider:
Stability Number and f-Factors in Graphs. 197-202 - Zengti Li, Eiichi Bannai, Etsuko Bannai:
Tight Relative 2- and 4-Designs on Binary Hamming Association Schemes. 203-227 - Hongliang Lu, Wei Wang:
On Perfect k-Matchings. 229-235 - P. Titus, K. Ganesamoorthy:
The Connected Monophonic Number of a Graph. 237-245 - Haoli Wang, Xirong Xu, Yuansheng Yang, Baosheng Zhang:
Some Graphs with Double Domination Subdivision Number Three. 247-251 - Haoli Wang, Xirong Xu, Yuansheng Yang, Baosheng Zhang:
Erratum to: Some Graphs with Double Domination Subdivision Number Three. 253
Volume 30, Number 2, March 2014
- Dan Archdeacon, Terry S. Griggs, Costas Psomas:
Representing Graphs in Steiner Triple Systems. 255-266 - Ben Barber:
Maximum Hitting for n Sufficiently Large. 267-274 - Manu Basavaraju, L. Sunil Chandran, Deepak Rajendraprasad, Arunselvan Ramaswamy:
Rainbow Connection Number and Radius. 275-285 - Adam Bohn:
Chromatic Polynomials of Complements of Bipartite Graphs. 287-301 - Flavia Bonomo, Mario Valencia-Pabon:
On the Minimum Sum Coloring of P 4-Sparse Graphs. 303-314 - Elena A. Caffarelli, Denise M. Halverson, Ryan J. Jensen:
The Steiner Problem on Surfaces of Revolution. 315-342 - Pablo De Caria, Marisa Gutierrez:
Special Eccentric Vertices for the Class of Chordal Graphs and Related Classes. 343-352 - Ross Churchley, Jing Huang:
Solving Partition Problems with Colour-Bipartitions. 353-364 - Louis Esperet, András Gyárfás, Frédéric Maffray:
List-Coloring Claw-Free Graphs with Small Clique Number. 365-375 - Maxfield Leidner:
A Larger Family of Planar Graphs that Satisfy the Total Coloring Conjecture. 377-388 - Allan Lo, Ta Sheng Tan:
A Note on Large Rainbow Matchings in Edge-coloured Graphs. 389-393 - Vadim V. Lozin, Martin Milanic, Christopher Purcell:
Graphs Without Large Apples and the Maximum Weight Independent Set Problem. 395-410 - Xiuwen Ma, Zihong Tian:
The Existence of FrGBT D(4, g u )′ s. 411-427 - Haruhide Matsuda, Kenta Ozeki, Tomoki Yamashita:
Spanning Trees with a Bounded Number of Branch Vertices in a Claw-Free Graph. 429-437 - Pascal Ochem, Alexandre Pinlou:
Oriented Coloring of Triangle-Free Planar Graphs and 2-Outerplanar Graphs. 439-453 - Pawel Pralat:
Graphs with Average Degree Smaller Than $${\frac {30}{11}}$$ Burn Slowly. 455-470 - Makoto Ueno, Shinsei Tazawa:
Enumeration of Bipartite Self-Complementary Graphs. 471-477 - Ligong Wang, Guopeng Zhao, Ke Li:
Seidel Integral Complete r-Partite Graphs. 479-493 - Rui Xu:
Strong 5-Cycle Double Covers of Graphs. 495-499 - Weihua Yang, Hong-Jian Lai, Hao Li, Xiaofeng Guo:
Collapsible Graphs and Hamiltonicity of Line Graphs. 501-510
Volume 30, Number 3, May 2014
- Rangaswami Balakrishnan, S. Francis Raj, T. Kavaskar:
b-Chromatic Number of Cartesian Product of Some Families of Graphs. 511-520 - Miklós Bóna:
On a Family of Conjectures of Joel Lewis on Alternating Permutations. 521-526 - Jason I. Brown, Julia Tufts:
On the Roots of Domination Polynomials. 527-547 - H. Chuang, Hong-Jian Lai, G. R. Omidi, K. Wang, Niloufar Zakeri:
On Group Choosability of Graphs, II. 549-563 - Sylwia Cichacz:
Note on Group Distance Magic Graphs G[C 4]. 565-571 - Janusz Dybizbanski, Tomasz Dzido:
On Some Ramsey Numbers for Quadrilaterals Versus Wheels. 573-579 - Pu Gao:
Uniform Generation of d-Factors in Dense Host Graphs. 581-589 - Tanja Gologranc, Gasper Mekis, Iztok Peterin:
Rainbow Connection and Graph Products. 591-607 - Ruth Haas, Karen Seyffarth:
The k-Dominating Graph. 609-617 - Mirko Hornák, Rafal Kalinowski, Mariusz Meszka, Mariusz Wozniak:
Minimum Number of Palettes in Edge Colorings. 619-626 - Shunchang Huang, Lingsheng Shi:
Packing Triangles in K 4-Free Graphs. 627-632 - Nicholas Korpelainen, Vadim V. Lozin, Colin Mayhill:
Split Permutation Graphs. 633-646 - Tomer Kotek, James Preen, Peter Tittmann:
Subset-Sum Representations of Domination Polynomials. 647-660 - Tatjana Gerzen:
An NP-Completeness Result of Edge Search in Graphs. 661-669 - Jaromy Kuhl, Hannah Hinojosa:
Avoiding Pairs of Partial Latin Squares. 671-685 - Jinbo Li, Guizhen Liu, Guanghui Wang:
Fractional f-Edge Cover Chromatic Index of Graphs. 687-698 - Fengxia Liu, Zhao Zhang, Jixiang Meng:
The Size of Maximally Irregular Graphs and Maximally Irregular Triangle-Free Graphs. 699-705 - Zoran S. Pucanovic, Zoran Z. Petrovic:
Toroidality of Intersection Graphs of Ideals of Commutative Rings. 707-716 - Nader Jafari Rad, Joanna Raczek:
Some Progress on Total Bondage in Graphs. 717-728 - Hans Raj Tiwary, Khaled M. Elbassioni:
Self-Duality of Polytopes and its Relations to Vertex Enumeration and Graph Isomorphism. 729-742 - Jichang Wu, Hajo Broersma, Haiyan Kang:
Removable Edges and Chords of Longest Cycles in 3-Connected Graphs. 743-753 - Bing Xue, Liancui Zuo, Guanghui Wang, Guojun Li:
The Linear t-Colorings of Sierpiński-Like Graphs. 755-767 - Xiaoxia Zhang, Xiangwen Li:
The Chvátal-Erdös Condition for Group Connectivity in Graphs. 769-781
Volume 30, Number 4, July 2014
- Susan A. van Aardt, Alewyn P. Burger, Marietjie Frick, Bernardo Llano, Rita Zuazua:
Infinite families of 2-hypohamiltonian/2-hypotraceable oriented graphs. 783-800 - Saeed Akbari, Maryam Ghanbari, Mohammad Javad Nikmehr:
The Chromatic Index of a Graph Whose Core is a Cycle of Order at Most 13. 801-819 - Saieed Akbari, Mikio Kano:
{k, r - k}-Factors of r-Regular Graphs. 821-826 - Boris Aronov, Muriel Dulieu, Ferran Hurtado:
Witness Rectangle Graphs. 827-846 - Arthur H. Busch, Michael Ferrara, Stephen G. Hartke, Michael S. Jacobson:
A Degree Sequence Variant of Graph Ramsey Numbers. 847-859 - Min Chen, André Raspaud, Weifan Wang:
Plane Graphs with Maximum Degree 6 are Edge-face 8-colorable. 861-874 - Kefeng Diao, Ping Zhao, Kaishun Wang:
The Smallest One-Realization of a Given Set III. 875-885 - Ralph J. Faudree, Jeno Lehel, Kiyoshi Yoshimoto:
Note on Locating Pairs of Vertices on Hamiltonian Cycles. 887-894 - Ramiro Feria-Purón, Guillermo Pineda-Villavicencio:
Constructions of Large Graphs on Surfaces. 895-908 - Michael A. Henning, Anders Yeo:
Distinguishing-Transversal in Hypergraphs and Identifying Open Codes in Cubic Graphs. 909-932 - Michael Hoffmann, Csaba D. Tóth:
Vertex-Colored Encompassing Graphs. 933-947 - Hengzhe Li, Xueliang Li, Yuefang Sun, Yan Zhao:
Note on Minimally d-Rainbow Connected Graphs. 949-955 - Ryota Matsubara, Masao Tsugaki, Tomoki Yamashita:
Closure and Spanning k-Trees. 957-962 - Giuseppe Mazzuoccolo, Beatrice Ruini:
Upper Bounds for the Automorphic Chromatic Index of a Graph. 963-975 - Cam McLeman, Erin McNicholas:
Graph Invertibility. 977-1002 - Michael D. Plummer, Tao Wang, Qinglin Yu:
A Note on Cyclic Connectivity and Matching Properties of Regular Graphs. 1003-1011 - Elzbieta Sidorowicz:
On the Relaxed Colouring Game and the Unilateral Colouring Game. 1013-1036 - Ali Asghar Talebi, Narges Mehdipoor:
Classifying Cubic Semisymmetric Graphs of Order 18 p n. 1037-1044 - Ngo Dac Tan:
On d-arc-dominated Oriented Graphs. 1045-1054 - Xiaoxia Zhang, Xiangwen Li:
Maximum Degree Condition and Group Connectivity. 1055-1063
Volume 30, Number 5, September 2014
- Eyal Ackerman, Noa Nitzan, Rom Pinchasi:
The Maximum Number of Edges in Geometric Graphs with Pairwise Virtually Avoiding Edges. 1065-1072 - Deepak Bal, Patrick Bennett, Andrzej Dudek, Alan M. Frieze:
The t-Tone Chromatic Number of Random Graphs. 1073-1086 - Tomasz Bartnicki, Bartlomiej Bosek, Sebastian Czerwinski, Jaroslaw Grytczuk, Grzegorz Matecki, Wiktor Zelazny:
Additive Coloring of Planar Graphs. 1087-1098 - Qiuju Bian, Ronald J. Gould, Paul Horn, Susan Janiszewski, Steve La Fleur, Paul Wrayno:
3-Connected {K 1, 3, P 9}-Free Graphs are Hamiltonian-Connected. 1099-1122 - Changjiang Bu, Jiang Zhou, Hongbo Li, Wenzhe Wang:
Spectral Characterizations of the Corona of a Cycle and Two Isolated Vertices. 1123-1133 - Lyes Dekar, Brice Effantin, Hamamache Kheddouci:
[r, s, t]-Colorings of Graph Products. 1135-1147 - Yoshimi Egawa, Michitaka Furuya:
Forbidden Triples Containing a Complete Graph and a Complete Bipartite Graph of Small Order. 1149-1162 - Qiaoping Guo, Shengjia Li, Hongwei Li, Huiling Zhao:
The Number of Out-Pancyclic Vertices in a Strong Tournament. 1163-1173 - Johannes H. Hattingh, Ernst J. Joubert:
Some Bistar Bipartite Ramsey Numbers. 1175-1181 - Chang-Xiang He, Min Zhou:
A Sharp Upper Bound on the Least Signless Laplacian Eigenvalue Using Domination Number. 1183-1192 - Sho Kato, Ryuichi Mori, Atsuhiro Nakamoto:
Quadrangulations on 3-Colored Point Sets with Steiner Points and Their Winding Numbers. 1193-1205 - Sergey Kitaev, Anna de Mier:
Enumeration of Fixed Points of an Involution on β(1, 0)-Trees. 1207-1221 - M. A. Ollis, Devin Willmott:
There are Infinitely Many Williams Squares with Circular Structure and Order a Multiple of 4. 1223-1232 - Kelly J. Pearson, Tan Zhang:
On Spectral Hypergraph Theory of the Adjacency Tensor. 1233-1248 - Dmitry A. Shabanov:
Coloring Non-uniform Hypergraphs Without Short Cycles. 1249-1260 - Runli Tian, Liming Xiong, Zhaohong Niu:
On Hamiltonicity of 3-Connected Claw-Free Graphs. 1261-1269 - Yue-Li Wang, Jun-Lin Guo, Cheng-Huang Hung, Hung-Chang Chan:
Circuits of Each Length in Tournaments. 1271-1282 - Guangjun Xu, Sanming Zhou:
Hamiltonicity of 3-Arc Graphs. 1283-1299 - Landang Yuan, Yanli Zhang, Yingtao Hou, Qingde Kang:
The Spectrum Meta(H > T, λ) for Some Subgraphs H and T of K 4. 1301-1318 - Hua Zhang:
A Class of Bipartite 2-Path-Transitive Graphs. 1319-1324
Volume 30, Number 6, November 2014
- Richard P. Anstee, Christina Koch, Miguel Raggi, Attila Sali:
Forbidden Configurations and Product Constructions. 1325-1349 - Dan Archdeacon:
Steiner Triple Systems, Pinched Surfaces, and Complete Multigraphs. 1351-1361 - Manu Basavaraju, L. Sunil Chandran, Deepak Rajendraprasad, Arunselvan Ramaswamy:
Rainbow Connection Number of Graph Power and Graph Products. 1363-1382 - Jason I. Brown, Ortrud R. Oellermann:
Graphs with a Minimal Number of Convex Sets. 1383-1397 - Yair Caro, Michael A. Henning:
Simultaneous Domination in Graphs. 1399-1416 - Gérard D. Cohen, Emanuela Fachini, János Körner:
Connector Families of Graphs. 1417-1425 - Maciej Dziemianczuk:
Counting Lattice Paths With Four Types of Steps. 1427-1452 - Xiaofeng Gu, Hong-Jian Lai, Ping Li, Senmei Yao:
Characterizations of Strength Extremal Graphs. 1453-1461 - Martin Hall, Colton Magnant, Hua Wang:
Note on Enomoto and Ota's Conjecture for Short Paths in Large Graphs. 1463-1467 - Rafal Kalinowski, Mariusz Wozniak:
Edge-Distinguishing Index of a Graph. 1469-1477 - Sandra R. Kingan, Manoel Lemos:
A Decomposition Theorem for Binary Matroids with no Prism Minor. 1479-1497 - Xiaoling Ma, Elkin Vumar:
Neighborhood Union Conditions for Hamiltonicity of P 3-Dominated Graphs. 1499-1511 - John Vincent S. Morales, Arlene A. Pascasio:
An Action of the Tetrahedron Algebra on the Standard Module for the Hamming Graphs and Doob Graphs. 1513-1527 - Oktay Olmez, Sung-Yell Song:
Some Families of Directed Strongly Regular Graphs Obtained from Certain Finite Incidence Structures. 1529-1549 - Eminjan Sabir, Elkin Vumar:
Spanning Connectivity of the Power of a Graph and Hamilton-Connected Index of a Graph. 1551-1563 - Noah Streib, William T. Trotter:
Hamiltonian Cycles and Symmetric Chains in Boolean Lattices. 1565-1586 - Tomás Vetrík:
Abelian Cayley Graphs of Given Degree and Diameter 2 and 3. 1587-1591 - Stephan G. Wagner, Hua Wang:
Indistinguishable Trees and Graphs. 1593-1605 - Yingqiu Yang, Liang Sun:
Contractible Edges in k-Connected Graphs with Some Forbidden Subgraphs. 1607-1614 - Jianhua Yin, Rong Luo, Guodong Guo:
Graphic Sequences with an A-Connected Realization. 1615-1620
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-12 22:53 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:
