Stop the war!Остановите войну!
for scientists:
default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDGraphs and Combinatorics, Volume 33
Volume 33, Number 1, January 2017
- Eiichi Bannai, Etsuko Bannai, Hajime Tanaka
, Yan Zhu:
Design Theory from the Viewpoint of Algebraic Combinatorics. 1-41 - Janusz Adamus:
A Degree Sum Condition for Hamiltonicity in Balanced Bipartite Digraphs. 43-51 - Tsyndyma Chimit-Dordjievna Batueva, Oleg V. Borodin, Anna O. Ivanova:
All Tight Descriptions of 4-Paths in 3-Polytopes with Minimum Degree 5. 53-62 - Oleg V. Borodin, Anna O. Ivanova, Ekaterina I. Vasil'eva:
A Steinberg-Like Approach to Describing Faces in 3-Polytopes. 63-71 - Qin Chen, Chengye Zhao, Min Zhao:
Dominator Colorings of Certain Cartesian Products of Paths and Cycles. 73-83 - Eddie Cheng, Li Li, László Lipták, Sangho Shim, Daniel E. Steffy:
On the Problem of Determining which (n, k)-Star Graphs are Cayley Graphs. 85-102 - Colin Defant:
Preimages Under the Stack-Sorting Algorithm. 103-122 - Ziwen Huang, Xiangwen Li, Jianqing Ma:
Z3-Connectivity of Claw-Free Graphs. 123-140 - Binlong Li, Yanbo Zhang, Hajo Broersma:
An Exact Formula for all Star-Kipas Ramsey Numbers. 141-148 - Xiaoye Liang, Ying-Ying Tan, Tatsuro Ito:
An Observation on Leonard System Parameters for the Terwilliger Algebra of the Johnson Scheme J(N, D). 149-156 - Benjian Lv, Li-Ping Huang, Kaishun Wang:
Endomorphisms of Twisted Grassmann Graphs. 157-169 - Jerod Michel:
A Note on Directed Strongly Regular Graphs. 171-179 - Theodore Molla, Michael Santana, Elyse Yeager:
A Refinement of Theorems on Vertex-Disjoint Chorded Cycles. 181-201 - S. Francis Raj, R. Pandiyaraj, H. P. Patil:
On Indicated Chromatic Number of Graphs. 203-219 - Douglas B. West, Jennifer Wise:
Bar Visibility Numbers for Hypercubes and Outerplanar Digraphs. 221-231 - Kristiana Wijaya, Edy Tri Baskoro, Hilda Assiyatun, Djoko Suprijanto:
On Ramsey (mK2,H)-Minimal Graphs. 233-243 - Yuqin Zhang, Fan Wu, Liandi Zhang:
All M2-Equicoverable Graphs. 245-256
Volume 33, Number 2, March 2017
- Eric Andrews, Gary Chartrand, Chira Lumduanhom, Ping Zhang:
Stars and Their k-Ramsey Numbers. 257-274 - Subramanian Arumugam, K. Premalatha, Martin Baca, Andrea Semanicová-Fenovcíková:
Local Antimagic Vertex Coloring of a Graph. 275-285 - Christian Barrientos, Elliot Krop:
Improved Bounds for Relaxed Graceful Trees. 287-305 - Patrick Bennett, Andrzej Dudek, Elliot Laforge:
On the Number of Alternating Paths in Bipartite Complete Graphs. 307-320 - John S. Caughman IV, John Krussel, James Mahoney:
Spanning Tree Decompositions of Complete Graphs Orthogonal to Rotational 1-Factorizations. 321-333 - Yaojun Chen, Zhengke Miao, Guofei Zhou:
All Quadrilateral-Wheel Planar Ramsey Numbers. 335-346 - Keith Copenhaver:
k-Protected Vertices in Unlabeled Rooted Plane Trees. 347-355 - Washiela Fish, N. B. Mumba, Eric C. Mwambene, Bernardo Gabriel Rodrigues:
Binary Codes and Partial Permutation Decoding Sets from Biadjacency Matrices of the Bipartite Graphs Γ ( 2 k + 1 , k , k + 2 , 1 ). 357-368 - Ronald J. Gould, Colton Magnant, Pouria Salehi Nowbandegani:
Placing Specified Vertices at Precise Locations on a Hamiltonian Cycle. 369-385 - Jonas Groschwitz, Tibor Szabó:
Sharp Thresholds for Half-Random Games II. 387-401 - Michael A. Henning:
Edge Weighting Functions on Semitotal Dominating Sets. 403-417 - Jingjing Huo, Weifan Wang, Chuandong Xu:
Neighbor Sum Distinguishing Index of Subcubic Graphs. 419-431 - Ernst J. Joubert:
Some Generalized Bipartite Ramsey Numbers Involving Short Cycles. 433-448 - Dieter Mitsche, Pawel Pralat, Elham Roshanbin:
Burning Graphs: A Probabilistic Perspective. 449-471 - Gabriel Nivasch, Eran Omri:
Rainbow Matchings and Algebras of Sets. 473-484 - Yaroslav Shitov:
Coloring the Power Graph of a Semigroup. 485-487 - Wei Wang, Jianguo Qian, Zhidan Yan:
Towards a Version of Ohba's Conjecture for Improper Colorings. 489-501 - Long-Tu Yuan, Xiao-Dong Zhang:
A Variation of the Erdős-Sós Conjecture in Bipartite Graphs. 503-526
Volume 33, Number 3, May 2017
- Qiumin Guo, Weili Guo, Wentao Hu, Guangfeng Jiang:
The Global Invariant of Signed Graphic hyperplane Arrangements. 527-535 - Jirapha Limbupasiriporn:
Codes from Neighbourhood Designs of the Graphs GP(q, (q-1)/2) with q Odd. 537-548 - Xiao-Nan Lu:
Improving the Existence Bounds for Grid-Block Difference Families. 549-559 - Kazuki Matsubara, Masanori Sawa, Sanpei Kageyama:
Existence on Splitting-Balanced Block Designs with Resolvability. 561-572 - Ahmad Sabri, Vincent Vajnovszki:
More Restricted Growth Functions: Gray Codes and Exhaustive Generation. 573-582
Volume 33, Number 4, July 2017
- Susan A. van Aardt, Jean E. Dunbar, Marietjie Frick, Ortrud R. Oellermann, Johan P. de Wet:
On Saito's Conjecture and the Oberly-Sumner Conjectures. 583-594 - Paniz Abedin, Saieed Akbari, Marc Demange, Tínaz Ekim:
Complexity of the Improper Twin Edge Coloring of Graphs. 595-615 - Raquel Águeda, Valentin Borozan, Marina Groshaus, Yannis Manoussakis, Gervais Mendy, Leandro Montero:
Proper Hamiltonian Paths in Edge-Coloured Multigraphs. 617-633 - Yasmeen Akhtar, Soumen Maity:
Covering Arrays on Product Graphs. 635-652 - Liliana Alcón, Flavia Bonomo, María Pía Mazzoleni:
Vertex Intersection Graphs of Paths on a Grid: Characterization Within Block Graphs. 653-664 - Saeid Alikhani, Davood Fatehi, Sandi Klavzar:
On the Structure of Dominating Graphs. 665-672 - Hanieh Amjadi, Nasrin Soltankhah:
The 3-Way Intersection Problem for Kirkman Triple Systems. 673-687 - Gabriela Araujo-Pardo, César Hernández-Cruz, Juan José Montellano-Ballesteros:
The Strong Convexity Spectra of Grids. 689-713 - John Asplund, Joe Chaffee, James M. Hammer:
Decomposition of a Complete Bipartite Multigraph into Arbitrary Cycle Sizes. 715-728 - Oliver Bendele, Dieter Rautenbach:
Optimal Colorings with Rainbow Paths. 729-734 - Julien Bensmail, Christopher Duffy, Sagnik Sen:
Analogues of Cliques for (m, n)-Colored Mixed Graphs. 735-750 - Zhanar Berikkyzy, Christopher Cox, Michael Dairyko, Kirsten Hogenson, Mohit Kumbhat, Bernard Lidický, Kacy Messerschmidt, Kevin Moss, Kathleen Nowak, Kevin F. Palmowski, Derrick Stolee:
(4, 2)-Choosability of Planar Graphs with Forbidden Structures. 751-787 - Stéphane Bessy, Dieter Rautenbach:
Extremal Values of the Chromatic Number for a Given Degree Sequence. 789-799 - Anthony Bonato, Xavier Pérez-Giménez, Pawel Pralat, Benjamin Reiniger:
The Game of Overprescribed Cops and Robbers Played on Graphs. 801-815 - Prosenjit Bose, Vida Dujmovic, Pat Morin, Lucas Rioux-Maldague:
New Bounds for Facial Nonrepetitive Colouring. 817-832 - Christoph Brause, Trung Duy Doan, Ingo Schiermeyer:
Minimum Degree Conditions for the Proper Connection Number of Graphs. 833-843 - Christie S. Burris, Francis C. Motta, Patrick D. Shipman:
An Unoriented Variation on de Bruijn Sequences. 845-858 - Jijuan Chen, Tao Wang, Huiqin Zhang:
Acyclic Chromatic Index of Triangle-free 1-Planar Graphs. 859-868 - Kefeng Diao, Fuliang Lu, Vitaly I. Voloshin, Ping Zhao:
The Smallest Uniform Color-Bounded Hypergraphs Which are One-Realizations of a Given Set. 869-883 - Laihao Ding, Guanghui Wang, Jianliang Wu, Jiguo Yu:
Neighbor Sum (Set) Distinguishing Total Choosability Via the Combinatorial Nullstellensatz. 885-900 - Yunshu Gao, Qingsong Zou, Liyan Ma:
Vertex-Disjoint Quadrilaterals in Multigraphs. 901-912 - Michael A. Henning, Nader Jafari Rad:
On 2-Step and Hop Dominating Sets in Graphs. 913-927 - Katie Horacek, Rong Luo, Zhengke Miao, Yue Zhao:
Finding Δ(Σ) for a Surface Σ of Characteristic -6 and -7. 929-944 - Daiqiang Hu, Jian-Liang Wu, Donglei Yang, Xin Zhang:
On the Equitable Edge-Coloring of 1-Planar Graphs and Planar Graphs. 945-953 - Suyun Jiang, Jin Yan:
Partial Degree Conditions and Cycle Coverings in Bipartite Graphs. 955-967 - Robert Katic, Colton Magnant, Pouria Salehi Nowbandegani:
Forbidden Properly Edge-Colored Subgraphs that Force Large Highly Connected Monochromatic Subgraphs. 969-979 - Yaakov S. Kupitz, Horst Martini, Micha A. Perles:
k-Bisectors of Finite Planar Sets. 981-990 - Magdalena Lemanska, Rita Zuazua, Pawel Zylinski:
Total Dominating Sets in Maximal Outerplanar Graphs. 991-998 - Wenjing Li, Xueliang Li, Jingshu Zhang:
3-Rainbow Index and Forbidden Subgraphs. 999-1008 - Dmitriy S. Malyshev:
The Complexity of the Vertex 3-Colorability Problem for Some Hereditary Classes Defined By 5-Vertex Forbidden Induced Subgraphs. 1009-1022 - Eric Peterson, Paul S. Wenger:
Unit Hypercube Visibility Numbers of Trees. 1023-1035 - Douglas F. Rall, Kirsti Wash:
On Minimum Identifying Codes in Some Cartesian Product Graphs. 1037-1053 - Michael Szestopalow:
Fractional K4-Covers. 1055-1063 - Ye Wang, Yusheng Li:
Bounds for Bipartite Rainbow Ramsey Numbers. 1065-1079 - Yangsheng Zou, William L. Kocay:
Intersection Preserving Mappings. 1081-1087
Volume 33, Number 5, September 2017
- Zheng Yan:
Independence Number and k-Trees of Graphs. 1089-1093 - Guantao Chen, Mark N. Ellingham, Akira Saito, Songling Shan:
Spanning Trails with Maximum Degree at Most 4 in 2K2 -Free Graphs. 1095-1101 - Florian Lehner, Stephan Wagner:
Maximizing the Number of Independent Sets of Fixed Size in Connected Graphs with Given Independence Number. 1103-1118 - Enqiang Zhu, Zehui Shao, Jin Xu:
Semitotal Domination in Claw-Free Cubic Graphs. 1119-1130 - Yi Wang, Yan-Quan Feng, Jin-Xin Zhou:
Automorphism Group of the Varietal Hypercube Graph. 1131-1137 - Cláudia Linhares Sales, Ana Silva:
The b-Continuity of Graphs with Large Girth. 1139-1146 - Weihua Lu, Han Ren, Fugang Chao, Ni Cao:
Lower Bounds on the Number of Monochromatic Matchings in K2s+t-1. 1147-1154 - Ji-Ming Guo, Jianxi Li, Peng Huang, Wai Chee Shiu:
Coefficients of the Characteristic Polynomial of the (Signless, Normalized) Laplacian of a Graph. 1155-1164 - Cláudia Linhares Sales, Leonardo Sampaio Rocha, Ana Silva:
On the b-Continuity of the Lexicographic Product of Graphs. 1165-1180 - Bing Zhou:
On Color Critical Graphs with Large Adaptable Chromatic Numbers. 1181-1187 - Fiachra Knox, Naoki Matsumoto, Sebastián González Hermosillo de la Maza, Bojan Mohar, Cláudia Linhares Sales:
Proper Orientations of Planar Bipartite Graphs. 1189-1194 - Shasha Li, Yongtang Shi, Jianhua Tu:
The Generalized 3-Connectivity of Cayley Graphs on Symmetric Groups Generated by Trees and Cycles. 1195-1209 - Jicheng Ma:
The Automorphism Groups of Arc-Transitive Abelian p-Covers of K5. 1211-1218 - Bart De Bruyn:
On the adjacency algebras of near hexagons with an order. 1219-1230 - Douglas Bauer, Aori Nevo, Edward F. Schmeichel:
Best Monotone Degree Condition for the Hamiltonicity of Graphs with a 2-Factor. 1231-1248 - Xing Feng, Lianzhu Zhang, Mingzu Zhang:
A Sufficient Condition for Pfaffian Graphs on the Torus. 1249-1260 - Tsz Lung Chan:
Contractible Edges in k-Connected Infinite Graphs. 1261-1270 - Robert Melville, Wayne Goddard:
Coloring Graphs to Produce Properly Colored Walks. 1271-1281 - Domingos M. Cardoso, David Pokrass Jacobs, Vilmar Trevisan:
Laplacian Distribution and Domination. 1283-1295 - Bo Ling, Ben Gong Lou:
On Arc-Transitive Pentavalent Cayley Graphs on Finite Nonabelian Simple Groups. 1297-1306 - Jun Zhang, Yajuan Zang, Zihong Tian:
The Spectrum of G-ODλ(3, 4, v). 1307-1319 - Guantao Chen, Jie Han, Suil O, Songling Shan, Shoichi Tsuchiya:
Forbidden Pairs and the Existence of a Spanning Halin Subgraph. 1321-1345 - Sho Kubota:
Unification of Graph Products and Compatibility with Switching. 1347-1355 - Mirela Damian, Erik D. Demaine, Robin Y. Flatland, Joseph O'Rourke:
Unfolding Genus-2 Orthogonal Polyhedra with Linear Refinement. 1357-1379 - Xuanlong Ma, Min Feng, Kaishun Wang:
The Power Index of a Graph. 1381-1391
Volume 33, Number 6, November 2017
- Dennis Wong:
A New Universal Cycle for Permutations. 1393-1399 - Takayuki Hibi, McCabe Olsen, Akiyoshi Tsuchiya:
Self Dual Reflexive Simplices with Eulerian Polynomials. 1401-1404 - Yan Zhu, Eiichi Bannai, Etsuko Bannai, Takuya Ikuta, Kyoung-Tark Kim:
Harmonic Index Designs in Binary Hamming Schemes. 1405-1418 - Norio Konno, Hideo Mitsuhashi, Iwao Sato:
Quaternionic Grover Walks and Zeta Functions of Graphs with Loops. 1419-1432 - Shohei Satake:
The Asymmetry Number of Finite Tournaments, and Some Related Results. 1433-1442 - Seiya Negami, Thomas W. Tucker:
Bipartite Polyhedral Maps on Closed Surfaces are Distinguishing 3-Colorable with Few Exceptions. 1443-1450 - Mariusz Meszka, Magdalena Tyniec:
Maximal Edge-Colorings of Graphs. 1451-1458 - Hervé Hocquard, Jakub Przybylo:
On the Neighbour Sum Distinguishing Index of Graphs with Bounded Maximum Average Degree. 1459-1471 - Bonnie C. Jacob, Jobby Jacob:
lp-Optimal Rankings and Max-Optimal Rankings are Different. 1473-1483 - Kiyoshi Ando:
Small Components of the 5-Subgraph of a Contraction-critically 5-Connected Graph. 1485-1497 - Vadim E. Levit, Eugen Mandrescu:
The Roller-Coaster Conjecture Revisited. 1499-1508 - Gary R. W. Greaves, Akihiro Munemasa, Anni Peng:
On a Lower Bound for the Laplacian Eigenvalues of a Graph. 1509-1519 - Jung Rae Cho, Jeongmi Park, Yoshio Sano:
T-neighbor Systems and Travel Groupoids on a Graph. 1521-1529 - Serkan Kader:
Circuits in Suborbital Graphs for The Normalizer. 1531-1542 - Dmitry N. Kozlov:
The First Cheeger Constant of a Simplex. 1543-1564 - Joe Chaffee, Matt Noble:
A Dimension 6 Graph with Minimum Edge-set. 1565-1576 - Guang Li, Zai Ping Lu:
On Alternatively Connected Edge-Transitive Graphs of Square-free Order. 1577-1589 - Ugur Odabasi, Sibel Özkan:
Uniformly Resolvable Cycle Decompositions with Four Different Factors. 1591-1606 - Li-Ping Huang, Benjian Lv:
Cores and Independence Numbers of Grassmann Graphs. 1607-1620 - Glencora Borradaile, Hung Le, Melissa Sherman-Bennett:
Large Induced Acyclic and Outerplanar Subgraphs of 2-Outerplanar Graph. 1621-1634 - Ngoc-Khang Le:
Chromatic Number of ISK4-Free Graphs. 1635-1646
a service of 
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-04-25 05:28 CEST 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:
