default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDGraphs and Combinatorics, Volume 31
Volume 31, Number 1, January 2015
- Douglas Bauer
, Hajo Broersma, Jan van den Heuvel, Nathan Kahl, Aori Nevo, Edward F. Schmeichel, Douglas R. Woodall, Michael Yatauro:
Best Monotone Degree Conditions for Graph Properties: A Survey. 1-22 - Tatjana M. Aleksic, Miroslav Petrovic:
Cacti Whose Spread is Maximal. 23-34 - Victor Alvarez:
Parity-Constrained Triangulations with Steiner Points. 35-57 - Milica Andelic, Domingos M. Cardoso:
Spectral Characterization of Families of Split Graphs. 59-72 - Cristina Bazgan, Cédric Bentz, Christophe Picouleau, Bernard Ries:
Blockers for the Stability Number and the Chromatic Number. 73-90 - Matthias Beck, Daniel Blado, Joseph Crawford, Taïna Jean-Louis, Michael Young:
On Weak Chromatic Polynomials of Mixed Graphs. 91-98 - Roman Cada, Shuya Chiba, Kiyoshi Yoshimoto:
2-Factors in Claw-Free Graphs with Lower Bounds Cycle Lengths. 99-113 - Hortensia Galeana-Sánchez, Ricardo Strausz:
On Panchromatic Digraphs and the Panchromatic Number. 115-125 - Greg Gamble, Jamie Simpson:
Symmetric Difference-Free and Symmetric Difference-Closed Collections of Sets. 127-130 - András Gyárfás, Gábor N. Sárközy, Stanley M. Selkow:
Coverings by Few Monochromatic Pieces: A Transition Between Two Ramsey Problems. 131-140 - Xueliang Li, Sujuan Liu:
Rainbow Connection Number and the Number of Blocks. 141-147 - Lan Lin, Yixun Lin:
New Classes of Extremal Graphs with Given Bandwidth. 149-167 - Shengxiang Lv:
The Largest Demigenus Over All Signatures on K 3, n. 169-181 - Martín Manrique, S. Arumugam:
Vertex and Edge Dimension of Hypergraphs. 183-200 - Naoki Matsumoto:
Transitions of Hexangulations on the Sphere. 201-219 - Zhaohong Niu, Liming Xiong:
On Traceable Line Graphs. 221-233 - Lale Özkahya, Brendon Stanton:
On a Covering Problem in the Hypercube. 235-242 - Chengfu Qin, Xiaofeng Guo, Kiyoshi Ando:
The Removable Edges and the Contractible Subgraphs of 5-Connected Graphs. 243-254 - Andrew V. Sills, Hua Wang:
The Minimal Number of Subtrees of a Tree. 255-264 - Michael Stiebitz, Zsolt Tuza, Margit Voigt:
Orientations of Graphs with Prescribed Weighted Out-Degrees. 265-280 - Teruhisa Sugimoto:
Convex Pentagons for Edge-to-Edge Tiling, II. 281-298 - Olivia X. M. Yao, Ernest X. W. Xia:
Two Formulas of 2-Color Off-Diagonal Rado Numbers. 299-307 - Xiu-Mei Zhang, Xiao-Dong Zhang:
The Minimal Number of Subtrees with a Given Degree Sequence. 309-318
Volume 31, Number 2, March 2015
- Evangelos Kranakis:
Introduction to the Special Issue: Combinatorics and Geometry. 319-320 - Oswin Aichholzer, Luis Evaristo Caraballo, José Miguel Díaz-Báñez, Ruy Fabila Monroy, Carlos Ochoa, P. Nigsch:
Characterization of Extremal Antipodal Polygons. 321-333 - Oswin Aichholzer, Thomas Hackl, Alexander Pilz, Pedro Ramos, Vera Sacristán, Birgit Vogtenhuber:
Empty Triangles in Good Drawings of the Complete Graph. 335-345 - Jin Akiyama, Hyunwoo Seong:
A Criterion for a Pair of Convex Polygons to be Reversible. 347-360 - Greg Aloupis, Luis Barba, Jean-Lou De Carufel, Stefan Langerman, Diane L. Souvaine:
Isoperimetric Enclosures. 361-392 - Jurek Czyzowicz, Stefan Dobrev, Benson L. Joeris, Evangelos Kranakis, Danny Krizanc, Ján Manuch, Oscar Morales-Ponce, Jaroslav Opatrny, Ladislav Stacho, Jorge Urrutia:
Monitoring the Plane with Rotating Radars. 393-405 - Alfredo García Olaverri, Ferran Hurtado, Matias Korman, Inês Matos, Maria Saumell, Rodrigo I. Silveira, Javier Tejel, Csaba D. Tóth:
Geometric Biplane Graphs I: Maximal Graphs. 407-425 - Alfredo García Olaverri, Ferran Hurtado, Matias Korman, Inês Matos, Maria Saumell, Rodrigo I. Silveira, Javier Tejel, Csaba D. Tóth:
Geometric Biplane Graphs II: Graph Augmentation. 427-452 - Benson L. Joeris, Isabel Urrutia, Jorge Urrutia:
Geometric Spanning Cycles in Bichromatic Point Sets. 453-465 - Luis Montejano, Tudor Zamfirescu:
When is a Disk Trapped by Four Lines? 467-476 - János Pach, Gábor Tardos:
Cross-Intersecting Families of Vectors. 477-495
Volume 31, Number 3, May 2015
- Saieed Akbari, Dariush Kiani, Fatemeh Mohammadi, Somayeh Moradi, Farhad Rahmati:
An Algebraic Criterion for the Choosability of Graphs. 497-506 - Richard A. Brualdi, Hwa Kyung Kim:
Completions of Alternating Sign Matrices. 507-522 - Marco Buratti, Tommaso Traetta:
The Structure of 2-Pyramidal 2-Factorizations. 523-535 - Fatih Demirkale, Diane M. Donovan, Charles Curtis Lindner:
Intersection Problem for Simple 2-fold (3n, n, 3) Group Divisible Designs. 537-545 - Edward Dobson, Joy Morris:
Quotients of CI-Groups are CI-Groups. 547-550 - Rosena R. X. Du, Fu Liu:
Factorizations of Cycles and Multi-Noded Rooted Trees. 551-575 - Andrzej Dudek, Michael Ferrara:
Extensions of Results on Rainbow Hamilton Cycles in Uniform Hypergraphs. 577-583 - Zsolt Fekete, Tibor Jordán, Viktória E. Kaszanitzky:
Rigid Two-Dimensional Frameworks with Two Coincident Points. 585-599 - Shinya Fujita, Michitaka Furuya, Colton Magnant:
General Bounds on Rainbow Domination Numbers. 601-613 - Hortensia Galeana-Sánchez, Ingrid Torres-Ramos:
H-Paths and H-Cycles in H-Coloured Digraphs. 615-628 - David J. Galvin:
Counting Colorings of a Regular Graph. 629-638 - Jessie D. Jamieson, Anant P. Godbole, William B. Jamieson, Lucia C. Petito:
Sharp Concentration of Hitting Size for Random Set Systems. 639-648 - Binlong Li, Bo Ning, Hajo Broersma, Shenggui Zhang:
Characterizing Heavy Subgraph Pairs for Pancyclicity. 649-667 - Huiqiu Lin, Yuan Hong, Jinlong Shu:
Some Relations Between the Eigenvalues of Adjacency, Laplacian and Signless Laplacian Matrix of a Graph. 669-677 - Allan Lo, Klas Markström:
F-Factors in Hypergraphs Via Absorption. 679-712 - Houcine Boumediene Merouane, Mohammed Haddad, Mustapha Chellali, Hamamache Kheddouci:
Dominated Colorings of Graphs. 713-727 - Michel Mollard, Mark Ramras:
Edge Decompositions of Hypercubes by Paths and by Cycles. 729-741 - Emlee W. Nicholson, Bing Wei:
Degree Sum Condition for k-ordered Hamiltonian Connected Graphs. 743-755 - Lydia Ostermeier, Peter F. Stadler:
The Grid Property and Product-Like Hypergraphs. 757-770 - Monika Pilsniak, Mariusz Wozniak:
On the Total-Neighbor-Distinguishing Index by Sums. 771-782 - Hua Wang:
Centroid, Leaf-centroid, and Internal-centroid. 783-793 - Junlei Zhu, Yuehua Bu, Xiao Min:
Equitable List-Coloring for C 5-Free Plane Graphs Without Adjacent Triangles. 795-804
Volume 31, Number 4, July 2015
- Saieed Akbari, Maryam Ghanbari, Kenta Ozeki:
The Chromatic Index of a Claw-Free Graph Whose Core has Maximum Degree 2. 805-811 - Maryam Atapour, Seyed Mahmoud Sheikholeslami, Lutz Volkmann:
Global Roman Domination in Trees. 813-825 - Jiansheng Cai:
List Edge Coloring of Planar Graphs Without Non-Induced 6-Cycles. 827-832 - Nelson Castañeda, Ivan S. Gotchev:
Path Coverings with Prescribed Ends in Faulty Hypercubes. 833-869 - Tsz Lung Chan:
Contractible and Removable Edges in 3-Connected Infinite Graphs. 871-883 - Guantao Chen, Yinkui Li, Haicheng Ma, Tingzeng Wu, Liming Xiong:
An Extension of the Chvátal-Erdős Theorem: Counting the Number of Maximum Independent Sets. 885-896 - Jessica Chen, Le Chen, Derrick Liu:
Intersections of Cycles in k-Connected Graphs. 897-914 - Alfredo Donno:
Generalized Wreath Products of Graphs and Groups. 915-926 - Stefan Felsner, William T. Trotter, Veit Wiechert:
The Dimension of Posets with Planar Cover Graphs. 927-939 - Daniel Gray:
Bounds on Superpatterns Containing all Layered Permutations. 941-952 - Michael A. Henning:
Total Dominator Colorings and Total Domination in Graphs. 953-974 - Mirko Hornák, Davide Mazza, Norma Zagaglia Salvi:
Edge Colorings of the Direct Product of Two Graphs. 975-992 - Mingfang Huang, Xiangwen Li:
Group Connectivity and Matchings. 993-1001 - Robert Jajcay, Roman Nedela:
Half-Regular Cayley Maps. 1003-1018 - Patric R. J. Östergård, Ville H. Pettersson:
Exhaustive Search for Snake-in-the-Box Codes. 1019-1028 - Hortensia Galeana-Sánchez, Rocío Sánchez-López:
An Extension of Richardson's Theorem in m-Colored Digraphs. 1029-1041 - Ioan Tomescu, Sana Javed:
Extremal Bicyclic 3-Chromatic Graphs. 1043-1052 - Gurusamy Rengasamy Vijayakumar:
Uniquely Derived Generalized Line Graphs and Uniquely Represented Signed Graphs with Least Eigenvalues ≥ -2. 1053-1063 - Fan Yang, Xiangwen Li:
Group connectivity in J3 line graphs. 1065-1076 - Sherry H. F. Yan, Yaqiu Zhang:
On Lattice Paths with Four Types of Steps. 1077-1084 - Mingchao Zhang, Song Luo, Maiko Shigeno:
On the Number of Edges in a Minimum C6-Saturated Graph. 1085-1106
Volume 31, Number 5, September 2015
- Ron Aharoni, Eli Berger, Philipp Sprüssel:
Two Disjoint Independent Bases in Matroid-Graph Pairs. 1107-1116 - Marcin Anholcer, Sylwia Cichacz:
Note on Distance Magic Products G ∘ C4. 1117-1124 - Marcin Anholcer, Sylwia Cichacz, Iztok Peterin, Aleksandra Tepeh:
Distance Magic Labeling and Two Products of Graphs. 1125-1136 - Aubin Arroyo, Isabel Hubard, Klavdija Kutnar, Eugenia O'Reilly Regueiro, Primoz Sparl:
Classification of Symmetric Tabačjn Graphs. 1137-1153 - Jernej Azarija:
Tutte Polynomials and a Stronger Version of the Akiyama-Harary Problem. 1155-1161 - Camino Balbuena, Adriana Hansberg, Teresa W. Haynes, Michael A. Henning:
Total Domination Edge Critical Graphs with Total Domination Number Three and Many Dominating Pairs. 1163-1176 - Tomás Bálint, Július Czap:
Facial Parity 9-Edge-Coloring of Outerplane Graphs. 1177-1187 - Michael D. Barrus, Stephen G. Hartke, Mohit Kumbhat:
Non-minimal Degree-Sequence-Forcing Triples. 1189-1209 - Matthias Beck, Mela Hardin:
A Bivariate Chromatic Polynomial for Signed Graphs. 1211-1221 - Youssef Boudabbous, Pierre Ille, Bertrand Jouve, Abdeljelil Salhi:
Critically Twin Primitive 2-Structures. 1223-1247 - Andreas Brandstädt, Raffaele Mosca:
Maximum Weight Independent Sets in Odd-Hole-Free Graphs Without Dart or Without Bull. 1249-1262 - Bostjan Bresar, Douglas F. Rall:
On Cartesian Products Having a Minimum Dominating Set that is a Box or a Stairway. 1263-1270 - Javier Cano, Alfredo García Olaverri, Ferran Hurtado, Toshinori Sakai, Javier Tejel, Jorge Urrutia:
Blocking the k-Holes of Point Sets in the Plane. 1271-1287 - Nanyuan Cao, Kejun Chen, Yong Zhang:
Existence of Yang Hui Type Magic Squares. 1289-1310 - Walter Carballosa, Ana Portilla, José M. Rodríguez, José María Sigarreta:
Planarity and Hyperbolicity in Graphs. 1311-1324 - James M. Carraher, Thomas Mahoney, Gregory J. Puleo, Douglas B. West:
Sum-Paintability of Generalized Theta-Graphs. 1325-1334 - László Csirmaz, Péter Ligeti, Gábor Tardos:
Erdős-Pyber Theorem for Hypergraphs and Secret Sharing. 1335-1346 - Ratko Darda, Ademir Hujdurovic:
On Bounds for the Product Irregularity Strength of Graphs. 1347-1357 - Ali Dehghan, Mohammad-Reza Sadeghi, Arash Ahadi:
On the Complexity of Deciding Whether the Regular Number is at Most Two. 1359-1365 - Chaim Even-Zohar, Nati Linial:
A Note on the Inducibility of 4-Vertex Graphs. 1367-1380 - Washiela Fish:
Binary Codes and Partial Permutation Decoding Sets from the Johnson Graphs. 1381-1396 - Michitaka Furuya, Masaru Kamada, Kenta Ozeki:
The Existence of Semi-colorings in a Graph. 1397-1401 - Natalia Garcia-Colin, David G. Larman:
Projective Equivalences of k-neighbourly Polytopes. 1403-1422 - Xianya Geng, Shuna Hu, Shuchao Li:
Permanental Bounds of the Laplacian Matrix of Trees with Given Domination Number. 1423-1436 - Sathish Govindarajan, Abhijeet Khopkar:
On Locally Gabriel Geometric Graphs. 1437-1452 - Michael A. Henning, Sandi Klavzar, Douglas F. Rall:
Total Version of the Domination Game. 1453-1462 - Anne Berry, Andreas Brandstädt, Konrad Engel:
The Dilworth Number of Auto-Chordal Bipartite Graphs. 1463-1471 - Zhen-Mu Hong, Yi-Zheng Fan:
The Signless Laplacian or Adjacency Spectral Radius of Bicyclic Graphs with Given Number of Cut Edges. 1473-1485 - Robert Janczewski, Krzysztof Turowski:
The Backbone Coloring Problem for Bipartite Backbones. 1487-1496 - Ying-li Kang, Yingqian Wang:
Distance Constraints on Short Cycles for 3-Colorability of Planar graphs. 1497-1505 - Gyula O. H. Katona, Dániel T. Nagy:
Union-Intersecting Set Systems. 1507-1516 - Takefumi Kondo, Tetsu Toyoda:
Uniform Estimates of Nonlinear Spectral Gaps. 1517-1530 - Xiangwen Li:
Group Chromatic Number of Halin Graphs. 1531-1538 - Ruijuan Li, Xinhong Zhang, Qiaoping Guo:
Generalizing Vertex Pancyclic and k-ordered Graphs. 1539-1554 - Jiaao Li, Xinmin Hou, Zhen-Mu Hong, Xiaofeng Ding:
Parity Subgraphs with Few Common Edges and Nowhere-Zero 5-Flow. 1555-1566 - Jeremy Lyle:
A Structural Approach for Independent Domination of Regular Graphs. 1567-1588 - Jeremy L. Martin, Jennifer D. Wagner:
On the Spectra of Simplicial Rook Graphs. 1589-1611 - Dragan Masulovic:
Towards the Characterization of Finite Homomorphism-Homogeneous Oriented Graphs with Loops. 1613-1628 - Lorenz Minder, Thomas Sauerwald, Sven-Ake Wegner:
Asymptotic Bounds on the Equilateral Dimension of Hypercubes. 1629-1636 - Mustafa Mohamad, David Rappaport, Godfried Toussaint:
Minimum Many-to-Many Matchings for Computing the Distance Between Two Sequences. 1637-1648 - Raffaele Mosca, Paolo Nobili:
Polynomial Time Recognition of Essential Graphs Having Stability Number Equal to Matching Number. 1649-1658 - Kenta Ozeki, Takeshi Sugiyama:
Spanning k-Forests with Large Components in K1, k+1-Free Graphs. 1659-1677 - Kenta Ozeki:
A Toughness Condition for a Spanning Tree With Bounded Total Excesses. 1679-1688 - Oliver Schaudt, Vera Weil:
On Bounding the Difference of the Maximum Degree and the Clique Number. 1689-1702 - Nidhi Sehgal, C. A. Rodger:
4-Cycle Systems of Kn-E(F*). 1703-1714 - Tay-Woei Shyu:
Decomposition of Complete Bipartite Digraphs and Complete Digraphs into Directed Paths and Directed Cycles of Fixed Even Length. 1715-1725 - Yingzhi Tian, Jixiang Meng:
Restricted Connectivity for Some Interconnection Networks. 1727-1737 - Runli Tian, Liming Xiong:
The Chvátal-Erdős Condition for a Graph to Have a Spanning Trail. 1739-1754 - Huijuan Wang, Bin Liu, Jianliang Wu:
Total Coloring of Planar Graphs Without Chordal Short Cycles. 1755-1764 - Xiumei Wang, Weiping Shang, Jinjiang Yuan:
On Graphs with a Unique Perfect Matching. 1765-1777 - Wei Wang, Baoyindureng Wu, Zhidan Yan, Nini Xue:
A Weaker Version of a Conjecture on List Vertex Arboricity of Graphs. 1779-1787 - Guanghui Wang, Guiying Yan:
An Improved Upper Bound on Edge Weight Choosability of Graphs. 1789-1793 - Bing Xue, Liancui Zuo, Guojun Li:
Coloring the Square of Sierpiński Graphs. 1795-1805 - Zhidan Yan, Wei Wang, Nini Xue:
On Improperly Chromatic-Choosable Graphs. 1807-1814 - Gexin Yu:
Strong edge-colorings for k-degenerate graphs. 1815-1818
Volume 31, Number 6, November 2015
- Atsuhiro Nakamoto, Katsuhiro Ota, Akira Saito:
Preface. 1819-1820 - Susan A. van Aardt, Alewyn P. Burger, Marietjie Frick, Arnfried Kemnitz, Ingo Schiermeyer:
Hypohamiltonian Oriented Graphs of All Possible Orders. 1821-1831 - Noga Alon:
Size and Degree Anti-Ramsey Numbers. 1833-1839 - Sejeong Bang, Jack H. Koolen, Jongyook Park:
Some Results on the Eigenvalues of Distance-Regular Graphs. 1841-1853 - Marco Buratti, Graham J. Lovegrove, Tommaso Traetta:
On the Full Automorphism Group of a Hamiltonian Cycle System of Odd Order. 1855-1865 - Shoko Chisaki, Nobuko Miyamoto:
Difference Systems of Sets with Size 2. 1867-1881 - Mikio Kano, Zheng Yan:
Spanning Trees Whose Stems are Spiders. 1883-1887 - Yuki Kawasaki, Naoki Matsumoto, Atsuhiro Nakamoto:
N-Flips in 4-Connected Even Triangulations on the Sphere. 1889-1904 - Arnfried Kemnitz, Massimiliano Marangio, Margit Voigt:
Sum List Colorings of Wheels. 1905-1913 - Xiaonan Lu:
On Affine-Invariant Two-Fold Quadruple Systems. 1915-1927 - Seiya Negami:
3-Regular Maps on Closed Surfaces are Nearly Distinguishing 3-Colorable with Few Exceptions. 1929-1940 - Jaroslav Nesetril, Patrice Ossona de Mendez:
On Low Tree-Depth Decompositions. 1941-1963 - Kenta Noguchi, Yusuke Suzuki:
Relationship Among Triangulations, Quadrangulations and Optimal 1-Planar Graphs. 1965-1972 - Hiroshi Nozaki:
Linear Programming Bounds for Regular Graphs. 1973-1984 - Ingo Schiermeyer, Roman Soták:
Rainbow Numbers for Graphs Containing Small Cycles. 1985-1991 - Barbara M. Anthony, Michael E. Picollelli:
Complete r-partite Graphs Determined by their Domination Polynomial. 1993-2002 - Natacha Astromujoff, Mathieu Chapelle, Martín Matamala, Ioan Todinca, José Zamora:
Injective Colorings with Arithmetic Constraints. 2003-2017 - Martin Baca, Yasir Bashir, Muhammad Faisal Nadeem, Ayesha Shabbir:
On Super Edge-Antimagicness of Circulant Graphs. 2019-2028 - Sheng Bau, Naoki Matsumoto, Atsuhiro Nakamoto, Lijuan Zheng:
Minor Relations for Quadrangulations on the Sphere. 2029-2036 - Sheng Bau, Benjamin van Niekerk, David White:
An Intermediate Value Theorem for the Decycling Numbers of Toeplitz Graphs. 2037-2042 - Henning Bruhn, Oliver Schaudt:
The Journey of the Union-Closed Sets Conjecture. 2043-2074 - Rong Chen, Matt DeVos, Daryl Funk, Irene Pivotto:
Graphical Representations of Graphic Frame Matroids. 2075-2086 - Wei-Guo Chen, Zhi-Hong Chen:
Fan-Type Conditions for Spanning Eulerian Subgraphs. 2087-2102 - Zhi-Hong Chen, Miaomiao Han, Hong-Jian Lai, Mingquan Zhan:
Graphs with a 3-Cycle-2-Cover. 2103-2111 - Guantao Chen, Songling Shan:
Characterizing Forbidden Pairs for Hamiltonian Squares. 2113-2124 - Xiaodong Chen, Mingchu Li, Xin Ma:
Vertex Pancyclicity of Quadrangularly Connected Claw-free Graphs. 2125-2136 - Charles J. Colbourn:
Augmentation of Covering Arrays of Strength Two. 2137-2147 - Charles B. Crane:
Generalized Pancyclic Properties in Claw-free Graphs. 2149-2158 - Aseem Dalal, C. A. Rodger:
The Total Chromatic Number of Complete Multipartite Graphs with Low Deficiency. 2159-2173 - Peter Dankelmann:
On the Number of Resolving Pairs in Graphs. 2175-2180 - Peter J. Dukes, Alan C. H. Ling:
Graph Divisible Designs and Packing Constructions. 2181-2191 - Qiong Fan, Chunxiang Wang:
Saturation Numbers for Linear Forests P5 ∪ t P2. 2193-2200 - Michitaka Furuya, Shoichi Tsuchiya:
Claw-Free and N(2, 1, 0)-Free Graphs are Almost Net-Free. 2201-2205 - Hortensia Galeana-Sánchez, Juan José Montellano-Ballesteros:
Π-Kernels in Digraphs. 2207-2214 - Yusuke Higuchi, Iwao Sato:
A Balanced Signed Digraph. 2215-2230 - Xueliang Li, Yaping Mao:
On Extremal Graphs with at Most ℓ Internally Disjoint Steiner Trees Connecting Any n-1 Vertices. 2231-2259 - Shuchao Li, Yibing Song, Huihui Zhang:
On the Degree Distance of Unicyclic Graphs with Given Matching Number. 2261-2274 - Wei Liao, Mingchu Li:
[r, s, t]-Colorings of Friendship Graphs and Wheels. 2275-2292 - Changhong Lu, Kan Wang, Xingxing Yu:
On Tight Components and Anti-Tight Components. 2293-2297 - Leila Maherani, G. R. Omidi, Ghaffar Raeisi, Maryam Shahsiah:
On Three-Color Ramsey Number of Paths. 2299-2308 - Thomas Mahoney, Charles Tomlinson, Jennifer Wise:
Families of Online Sum-Choice-Greedy Graphs. 2309-2317 - Snjezana Majstorovic, Gilles Caporossi:
Bounds and Relations Involving Adjusted Centrality of the Vertices of a Tree. 2319-2334 - Dirk Meierling, Dieter Rautenbach:
Cycle Lengths of Hamiltonian Pℓ-free Graphs. 2335-2345 - Farokhlagha Moazami, Nasrin Soltankhah:
On the Biclique Cover of the Complete Graph. 2347-2356 - R. Pandiyaraj, S. Francis Raj, H. P. Patil:
On Indicated Coloring of Graphs. 2357-2367 - Zdenek Ryjácek, Liming Xiong, Jun Yin:
Closure and Hamilton-Connected Claw-Free Hourglass-Free Graphs. 2369-2376 - Tadashi Sakuma:
On the Balanced Decomposition Number. 2377-2380 - Elzbieta Sidorowicz:
The Relaxed Game Chromatic Number of Graphs with Cut-Vertices. 2381-2400 - Martin Sonntag, Hanns-Martin Teichert:
Some Results on Exclusive Sum Labelings of Hypergraphs. 2401-2412 - Andrea Vietri:
A New Zero-divisor Graph Contradicting Beck's Conjecture, and the Classification for a Family of Polynomial Quotients. 2413-2423 - Andrea Vietri:
An Analogy Between Edge Colourings and Differentiable Manifolds, with a New Perspective on 3-Critical Graphs. 2425-2435 - Yali Wu, Yongqi Sun, Rui Zhang, Stanislaw P. Radziszowski:
Ramsey Numbers of C4 versus Wheels and Stars. 2437-2446 - Xiaoxia Zhang, Xiangwen Li:
Z3-Connectivity of Wreath Product of Graphs. 2447-2457 - Yanbo Zhang, Guofei Zhou, Yaojun Chen:
All Complete Graph-Wheel Planar Ramsey Numbers. 2459-2465 - Yanbo Zhang, Hajo Broersma, Yaojun Chen:
Three Results on Cycle-Wheel Ramsey Numbers. 2467-2479 - Hongtao Zhao, Qingde Kang:
Large Sets of Almost Hamilton Cycle and Path Decompositions of Complete Bipartite Graphs. 2481-2491
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 01:23 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:
