Hits ?▲ |
Authors |
Title |
Venue |
Year |
Link |
Author keywords |
15 | Jim Geelen, Rohan Kapadia |
Computing Girth and Cogirth in Perturbed Graphic Matroids. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Comb. ![In: Comb. 38(1), pp. 167-191, 2018. The full citation details ...](Pics/full.jpeg) |
2018 |
DBLP DOI BibTeX RDF |
|
15 | Sina Vafi, Narges Rezvani Majid |
Combinatorial design-based quasi-cyclic LDPC codes with girth eight. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Digit. Commun. Networks ![In: Digit. Commun. Networks 4(4), pp. 296-300, 2018. The full citation details ...](Pics/full.jpeg) |
2018 |
DBLP DOI BibTeX RDF |
|
15 | Robert Jajcay, György Kiss, Stefko Miklavic |
Edge-girth-regular graphs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Eur. J. Comb. ![In: Eur. J. Comb. 72, pp. 70-82, 2018. The full citation details ...](Pics/full.jpeg) |
2018 |
DBLP DOI BibTeX RDF |
|
15 | Keaitsuda Maneeruk Nakprasit, Kittikorn Nakprasit |
The Game Coloring Number of Planar Graphs with a Specific Girth. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Graphs Comb. ![In: Graphs Comb. 34(2), pp. 349-354, 2018. The full citation details ...](Pics/full.jpeg) |
2018 |
DBLP DOI BibTeX RDF |
|
15 | Erbao Li, Le Dong, Jing Lei 0001 |
High Rate APPS and Bi-APPS LDPC Codes Design with Low Error Floor and Large Girth. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Wirel. Pers. Commun. ![In: Wirel. Pers. Commun. 100(3), pp. 709-720, 2018. The full citation details ...](Pics/full.jpeg) |
2018 |
DBLP DOI BibTeX RDF |
|
15 | Éric Fusy, Benjamin Lévêque |
Orientations and bijections for toroidal maps with prescribed face-degrees and essential girth. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/1807.00522, 2018. The full citation details ...](Pics/full.jpeg) |
2018 |
DBLP BibTeX RDF |
|
15 | Geoffrey Exoo, Jan Goedgebeur |
Bounds for the smallest k-chromatic graphs of given girth. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/1805.06713, 2018. The full citation details ...](Pics/full.jpeg) |
2018 |
DBLP BibTeX RDF |
|
15 | Ross J. Kang, Willem van Loon |
Tree-like distance colouring for planar graphs of sufficient girth. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/1805.02156, 2018. The full citation details ...](Pics/full.jpeg) |
2018 |
DBLP BibTeX RDF |
|
15 | Mohammad Hesam Tadayon, Alireza Tasdighi, Massimo Battaglioni, Marco Baldi, Franco Chiaraluce |
Efficient Search of Compact QC-LDPC and SC-LDPC Convolutional Codes with Large Girth. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/1804.06454, 2018. The full citation details ...](Pics/full.jpeg) |
2018 |
DBLP BibTeX RDF |
|
15 | Hoàng-Oanh Le, Van Bang Le |
Map graphs having witnesses of large girth. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/1812.04102, 2018. The full citation details ...](Pics/full.jpeg) |
2018 |
DBLP BibTeX RDF |
|
15 | Kazuhiro Kurita, Kunihiro Wasa, Alessio Conte, Hiroki Arimura, Takeaki Uno |
Efficient Enumeration of Subgraphs and Induced Subgraphs with Bounded Girth. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/1806.04307, 2018. The full citation details ...](Pics/full.jpeg) |
2018 |
DBLP BibTeX RDF |
|
15 | Shirshendu Ganguly, Nikhil Srivastava |
On Non-localization of Eigenvectors of High Girth Graphs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/1803.08038, 2018. The full citation details ...](Pics/full.jpeg) |
2018 |
DBLP BibTeX RDF |
|
15 | Gerard Jennhwa Chang, Guan-Huei Duh |
On the precise value of the strong chromatic index of a planar graph with a large girth. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Discret. Appl. Math. ![In: Discret. Appl. Math. 247, pp. 389-397, 2018. The full citation details ...](Pics/full.jpeg) |
2018 |
DBLP DOI BibTeX RDF |
|
15 | Camino Balbuena, Julián Fresán-Figueroa, Diego González-Moreno, Mika Olsen |
Rainbow connectivity of Moore cages of girth 6. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Discret. Appl. Math. ![In: Discret. Appl. Math. 250, pp. 104-109, 2018. The full citation details ...](Pics/full.jpeg) |
2018 |
DBLP DOI BibTeX RDF |
|
15 | Gholamreza Abrishami, Michael A. Henning |
Independent domination in subcubic graphs of girth at least six. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Discret. Math. ![In: Discret. Math. 341(1), pp. 155-164, 2018. The full citation details ...](Pics/full.jpeg) |
2018 |
DBLP DOI BibTeX RDF |
|
15 | Pu Qiao, Xingzhi Zhan |
The maximum girth and minimum circumference of graphs with prescribed radius and diameter. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Discret. Math. ![In: Discret. Math. 341(10), pp. 2827-2830, 2018. The full citation details ...](Pics/full.jpeg) |
2018 |
DBLP DOI BibTeX RDF |
|
15 | Hee Je Cho, Seong-Hun Paeng |
Classification of α-Ricci flat graphs with girth at least five. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Discret. Math. ![In: Discret. Math. 341(10), pp. 2894-2902, 2018. The full citation details ...](Pics/full.jpeg) |
2018 |
DBLP DOI BibTeX RDF |
|
15 | Louis Anthony Agong, Carmen Amarra, John S. Caughman IV, Ari J. Herman, Taiyo S. Terada |
On the girth and diameter of generalized Johnson graphs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Discret. Math. ![In: Discret. Math. 341(1), pp. 138-142, 2018. The full citation details ...](Pics/full.jpeg) |
2018 |
DBLP DOI BibTeX RDF |
|
15 | Slobodan Filipovski, Robert Jajcay |
On the excess of vertex-transitive graphs of given degree and girth. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Discret. Math. ![In: Discret. Math. 341(3), pp. 772-780, 2018. The full citation details ...](Pics/full.jpeg) |
2018 |
DBLP DOI BibTeX RDF |
|
15 | Aleksey N. Glebov |
Splitting a planar graph of girth 5 into two forests with trees of small diameter. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Discret. Math. ![In: Discret. Math. 341(7), pp. 2058-2067, 2018. The full citation details ...](Pics/full.jpeg) |
2018 |
DBLP DOI BibTeX RDF |
|
15 | Ágnes Backhausz, Balázs Szegedy |
On large-girth regular graphs and random processes on trees. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Random Struct. Algorithms ![In: Random Struct. Algorithms 53(3), pp. 389-416, 2018. The full citation details ...](Pics/full.jpeg) |
2018 |
DBLP DOI BibTeX RDF |
|
15 | Dominic Dotterrer, Larry Guth, Matthew Kahle |
2-Complexes with Large 2-Girth. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Discret. Comput. Geom. ![In: Discret. Comput. Geom. 59(2), pp. 383-412, 2018. The full citation details ...](Pics/full.jpeg) |
2018 |
DBLP DOI BibTeX RDF |
|
15 | Christian Rubio-Montiel |
The 4-girth-thickness of the complete graph. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Ars Math. Contemp. ![In: Ars Math. Contemp. 14(2), pp. 319-327, 2018. The full citation details ...](Pics/full.jpeg) |
2018 |
DBLP DOI BibTeX RDF |
|
15 | Guillem Perarnau, Will Perkins 0001 |
Counting independent sets in cubic graphs of given girth. ![Search on Bibsonomy](Pics/bibsonomy.png) |
J. Comb. Theory, Ser. B ![In: J. Comb. Theory, Ser. B 133, pp. 211-242, 2018. The full citation details ...](Pics/full.jpeg) |
2018 |
DBLP DOI BibTeX RDF |
|
15 | Mohammad-Reza Sadeghi 0001, Farzane Amirzade |
Analytical Lower Bound on the Lifting Degree of Multiple-Edge QC-LDPC Codes With Girth 6. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IEEE Commun. Lett. ![In: IEEE Commun. Lett. 22(8), pp. 1528-1531, 2018. The full citation details ...](Pics/full.jpeg) |
2018 |
DBLP DOI BibTeX RDF |
|
15 | Mohammad Hesam Tadayon, Alireza Tasdighi, Massimo Battaglioni, Marco Baldi, Franco Chiaraluce |
Efficient Search of Compact QC-LDPC and SC-LDPC Convolutional Codes With Large Girth. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IEEE Commun. Lett. ![In: IEEE Commun. Lett. 22(6), pp. 1156-1159, 2018. The full citation details ...](Pics/full.jpeg) |
2018 |
DBLP DOI BibTeX RDF |
|
15 | Tom Kelly 0001, Chun-Hung Liu |
Size of the largest induced forest in subcubic graphs of girth at least four and five. ![Search on Bibsonomy](Pics/bibsonomy.png) |
J. Graph Theory ![In: J. Graph Theory 89(4), pp. 457-478, 2018. The full citation details ...](Pics/full.jpeg) |
2018 |
DBLP DOI BibTeX RDF |
|
15 | Jan Goedgebeur, Carol T. Zamfirescu |
Infinitely many planar cubic hypohamiltonian graphs of girth 5. ![Search on Bibsonomy](Pics/bibsonomy.png) |
J. Graph Theory ![In: J. Graph Theory 88(1), pp. 40-45, 2018. The full citation details ...](Pics/full.jpeg) |
2018 |
DBLP DOI BibTeX RDF |
|
15 | Jakub Pachocki, Liam Roditty, Aaron Sidford, Roei Tov, Virginia Vassilevska Williams |
Approximating Cycles in Directed Graphs: Fast Algorithms for Girth and Roundtrip Spanners. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SODA ![In: Proceedings of the Twenty-Ninth Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2018, New Orleans, LA, USA, January 7-10, 2018, pp. 1374-1392, 2018, SIAM, 978-1-61197-503-1. The full citation details ...](Pics/full.jpeg) |
2018 |
DBLP DOI BibTeX RDF |
|
15 | Guohua Zhang, Yulin Hu, Qinwei He, Juhua Wang |
Type-II Quasi-Cyclic LDPC Codes with Girth Eight from Sidon Sequence. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ITW ![In: IEEE Information Theory Workshop, ITW 2018, Guangzhou, China, November 25-29, 2018, pp. 1-5, 2018, IEEE, 978-1-5386-3599-5. The full citation details ...](Pics/full.jpeg) |
2018 |
DBLP DOI BibTeX RDF |
|
15 | Xin Xiao, Bane Vasic, Shu Lin 0001, Khaled A. S. Abdel-Ghaffar, William E. Ryan |
Girth-Eight Reed-Solomon Based QC-LDPC Codes. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ISTC ![In: 10th IEEE International Symposium on Turbo Codes & Iterative Information Processing, ISTC 2018, Hong Kong, China, December 3-7, 2018, pp. 1-5, 2018, IEEE, 978-1-5386-7048-4. The full citation details ...](Pics/full.jpeg) |
2018 |
DBLP DOI BibTeX RDF |
|
15 | Kazuhiro Kurita, Kunihiro Wasa, Alessio Conte, Takeaki Uno, Hiroki Arimura |
Efficient Enumeration of Subgraphs and Induced Subgraphs with Bounded Girth. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IWOCA ![In: Combinatorial Algorithms - 29th International Workshop, IWOCA 2018, Singapore, July 16-19, 2018, Proceedings, pp. 201-213, 2018, Springer, 978-3-319-94666-5. The full citation details ...](Pics/full.jpeg) |
2018 |
DBLP DOI BibTeX RDF |
|
15 | Vasiliy Usatyuk, Ilya Vorobyev |
Simulated Annealing Method for Construction of High-Girth QC-LDPC Codes. ![Search on Bibsonomy](Pics/bibsonomy.png) |
TSP ![In: 41st International Conference on Telecommunications and Signal Processing, TSP 2018, Athens, Greece, July 4-6, 2018, pp. 1-5, 2018, IEEE, 978-1-5386-4695-3. The full citation details ...](Pics/full.jpeg) |
2018 |
DBLP DOI BibTeX RDF |
|
15 | Hengzhou Xu, Hai Zhu 0001, Mengmeng Xu, Bo Zhang 0053, Sifeng Zhu |
Girth Analysis of Tanner (5, 11) Quasi-Cyclic LDPC Codes. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CIS ![In: 14th International Conference on Computational Intelligence and Security, CIS 2018, Hangzhou, China, November 16-19, 2018, pp. 210-214, 2018, IEEE Computer Society, 978-1-7281-0169-9. The full citation details ...](Pics/full.jpeg) |
2018 |
DBLP DOI BibTeX RDF |
|
15 | Qiang Wang 0008, Tingting Lan |
Smart Construct High Girth LDPC Codes Based on Permutation Groups. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CIS ![In: 14th International Conference on Computational Intelligence and Security, CIS 2018, Hangzhou, China, November 16-19, 2018, pp. 353-356, 2018, IEEE Computer Society, 978-1-7281-0169-9. The full citation details ...](Pics/full.jpeg) |
2018 |
DBLP DOI BibTeX RDF |
|
15 | Wouter Cames van Batenburg, Ross J. Kang |
Packing two graphs of even girth 10. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Electron. Notes Discret. Math. ![In: Electron. Notes Discret. Math. 61, pp. 191-197, 2017. The full citation details ...](Pics/full.jpeg) |
2017 |
DBLP DOI BibTeX RDF |
|
15 | Wiebke Bedenknecht, Guilherme Oliveira Mota, Christian Reiher, Mathias Schacht |
On the local density problem for graphs of given odd-girth. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Electron. Notes Discret. Math. ![In: Electron. Notes Discret. Math. 62, pp. 39-44, 2017. The full citation details ...](Pics/full.jpeg) |
2017 |
DBLP DOI BibTeX RDF |
|
15 | Hengzhou Xu, Baoming Bai, Dan Feng 0002, Cheng Sun 0003 |
On the girth of Tanner (3, 11) quasi-cyclic LDPC codes. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Finite Fields Their Appl. ![In: Finite Fields Their Appl. 46, pp. 65-89, 2017. The full citation details ...](Pics/full.jpeg) |
2017 |
DBLP DOI BibTeX RDF |
|
15 | Oleg V. Borodin, Anna O. Ivanova |
All tight descriptions of 3-stars in 3-polytopes with girth 5. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Discuss. Math. Graph Theory ![In: Discuss. Math. Graph Theory 37(1), pp. 5-12, 2017. The full citation details ...](Pics/full.jpeg) |
2017 |
DBLP DOI BibTeX RDF |
|
15 | Xue-Qin Jiang 0001, Han Hai, Hui-Ming Wang 0001, Moon Ho Lee |
Constructing Large Girth QC Protograph LDPC Codes Based on PSD-PEG Algorithm. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IEEE Access ![In: IEEE Access 5, pp. 13489-13500, 2017. The full citation details ...](Pics/full.jpeg) |
2017 |
DBLP DOI BibTeX RDF |
|
15 | Tom Kelly 0001, Chun-Hung Liu |
Minimum size of feedback vertex sets of planar graphs of girth at least five. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Eur. J. Comb. ![In: Eur. J. Comb. 61, pp. 138-150, 2017. The full citation details ...](Pics/full.jpeg) |
2017 |
DBLP DOI BibTeX RDF |
|
15 | Dimitris Chatzidimitriou, Jean-Florent Raymond, Ignasi Sau, Dimitrios M. Thilikos |
Minors in graphs of large ϴr-girth. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Eur. J. Comb. ![In: Eur. J. Comb. 65, pp. 106-121, 2017. The full citation details ...](Pics/full.jpeg) |
2017 |
DBLP DOI BibTeX RDF |
|
15 | Fábio Botler, Guilherme Oliveira Mota, M. T. I. Oshiro, Yoshiko Wakabayashi |
Decomposing regular graphs with prescribed girth into paths of given length. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Eur. J. Comb. ![In: Eur. J. Comb. 66, pp. 28-36, 2017. The full citation details ...](Pics/full.jpeg) |
2017 |
DBLP DOI BibTeX RDF |
|
15 | József Solymosi, Ching Wong |
Cycles in graphs of fixed girth with large size. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Eur. J. Comb. ![In: Eur. J. Comb. 62, pp. 124-131, 2017. The full citation details ...](Pics/full.jpeg) |
2017 |
DBLP DOI BibTeX RDF |
|
15 | Michael Gentner, Dieter Rautenbach |
Dynamic monopolies for degree proportional thresholds in connected graphs of girth at least five and trees. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Theor. Comput. Sci. ![In: Theor. Comput. Sci. 667, pp. 93-100, 2017. The full citation details ...](Pics/full.jpeg) |
2017 |
DBLP DOI BibTeX RDF |
|
15 | Cláudia Linhares Sales, Ana Silva 0001 |
The b-Continuity of Graphs with Large Girth. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Graphs Comb. ![In: Graphs Comb. 33(5), pp. 1139-1146, 2017. The full citation details ...](Pics/full.jpeg) |
2017 |
DBLP DOI BibTeX RDF |
|
15 | Søren Dahlgaard, Mathias Bæk Tejs Knudsen, Morten Stöckel |
New Subquadratic Approximation Algorithms for the Girth. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/1704.02178, 2017. The full citation details ...](Pics/full.jpeg) |
2017 |
DBLP BibTeX RDF |
|
15 | László Csirmaz, Péter Ligeti |
Secret sharing on large girth graphs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/1705.10520, 2017. The full citation details ...](Pics/full.jpeg) |
2017 |
DBLP BibTeX RDF |
|
15 | Gang Ma 0005, Shengjin Ji, Qiuju Bian, Xia Li |
The minimum matching energy of tricyclic graphs and given girth and without K4-subdivision. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Ars Comb. ![In: Ars Comb. 132, pp. 403-419, 2017. The full citation details ...](Pics/full.jpeg) |
2017 |
DBLP BibTeX RDF |
|
15 | Mustapha Aouchiche, Pierre Hansen |
Proximity, remoteness and girth in graphs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Discret. Appl. Math. ![In: Discret. Appl. Math. 222, pp. 31-39, 2017. The full citation details ...](Pics/full.jpeg) |
2017 |
DBLP DOI BibTeX RDF |
|
15 | Gang Ma 0005, Qiuju Bian, Jianfeng Wang |
Bounds on the PI index of unicyclic and bicyclic graphs with given girth. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Discret. Appl. Math. ![In: Discret. Appl. Math. 230, pp. 156-161, 2017. The full citation details ...](Pics/full.jpeg) |
2017 |
DBLP DOI BibTeX RDF |
|
15 | Wei Dong, Wensong Lin |
On 2-distance coloring of plane graphs with girth 5. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Discret. Appl. Math. ![In: Discret. Appl. Math. 217, pp. 495-505, 2017. The full citation details ...](Pics/full.jpeg) |
2017 |
DBLP DOI BibTeX RDF |
|
15 | Boris Brimkov, Jennifer Edmond, Robert Lazar, Bernard Lidický, Kacy Messerschmidt, Shanise Walker |
Injective choosability of subcubic planar graphs with girth 6. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Discret. Math. ![In: Discret. Math. 340(10), pp. 2538-2549, 2017. The full citation details ...](Pics/full.jpeg) |
2017 |
DBLP DOI BibTeX RDF |
|
15 | Encarnación Abajo, Gabriela Araujo-Pardo, Camino Balbuena, Manuel Bendala |
New small regular graphs of girth 5. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Discret. Math. ![In: Discret. Math. 340(8), pp. 1878-1888, 2017. The full citation details ...](Pics/full.jpeg) |
2017 |
DBLP DOI BibTeX RDF |
|
15 | Clément Charpentier |
The coloring game on planar graphs with large girth, by a result on sparse cactuses. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Discret. Math. ![In: Discret. Math. 340(5), pp. 1069-1073, 2017. The full citation details ...](Pics/full.jpeg) |
2017 |
DBLP DOI BibTeX RDF |
|
15 | Alireza Tasdighi, Amir H. Banihashemi, Mohammad-Reza Sadeghi 0001 |
Symmetrical Constructions for Regular Girth-8 QC-LDPC Codes. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IEEE Trans. Commun. ![In: IEEE Trans. Commun. 65(1), pp. 14-22, 2017. The full citation details ...](Pics/full.jpeg) |
2017 |
DBLP DOI BibTeX RDF |
|
15 | Qingshan Feng, Rui Li 0064, Baohua Nie, Shucong Liu, Lianyu Zhao, Hong Zhang 0004 |
Literature Review: Theory and Application of In-Line Inspection Technologies for Oil and Gas Pipeline Girth Weld Defection. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Sensors ![In: Sensors 17(1), pp. 50, 2017. The full citation details ...](Pics/full.jpeg) |
2017 |
DBLP DOI BibTeX RDF |
|
15 | Xing Shi Cai, Guillem Perarnau, Bruce A. Reed, Adam Bene Watts |
Acyclic edge colourings of graphs with large girth. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Random Struct. Algorithms ![In: Random Struct. Algorithms 50(4), pp. 511-533, 2017. The full citation details ...](Pics/full.jpeg) |
2017 |
DBLP DOI BibTeX RDF |
|
15 | Miao Zhang, Min Chen 0012, Yiqiao Wang 0002 |
A sufficient condition for planar graphs with girth 5 to be (1, 7)-colorable. ![Search on Bibsonomy](Pics/bibsonomy.png) |
J. Comb. Optim. ![In: J. Comb. Optim. 33(3), pp. 847-865, 2017. The full citation details ...](Pics/full.jpeg) |
2017 |
DBLP DOI BibTeX RDF |
|
15 | Wei Dong, Baogang Xu |
2-Distance coloring of planar graphs with girth 5. ![Search on Bibsonomy](Pics/bibsonomy.png) |
J. Comb. Optim. ![In: J. Comb. Optim. 34(4), pp. 1302-1322, 2017. The full citation details ...](Pics/full.jpeg) |
2017 |
DBLP DOI BibTeX RDF |
|
15 | Amir Daneshgar, Meysam Madani |
On the odd girth and the circular chromatic number of generalized Petersen graphs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
J. Comb. Optim. ![In: J. Comb. Optim. 33(3), pp. 897-923, 2017. The full citation details ...](Pics/full.jpeg) |
2017 |
DBLP DOI BibTeX RDF |
|
15 | Guohua Zhang, Rudolf Mathar |
Explicit Constructions for Type-1 QC-LDPC Codes With Girth 12. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IEEE Commun. Lett. ![In: IEEE Commun. Lett. 21(3), pp. 460-463, 2017. The full citation details ...](Pics/full.jpeg) |
2017 |
DBLP DOI BibTeX RDF |
|
15 | Brendan D. McKay |
Hypohamiltonian Planar Cubic Graphs with Girth 5. ![Search on Bibsonomy](Pics/bibsonomy.png) |
J. Graph Theory ![In: J. Graph Theory 85(1), pp. 7-11, 2017. The full citation details ...](Pics/full.jpeg) |
2017 |
DBLP DOI BibTeX RDF |
|
15 | Maria Axenovich, Torsten Ueckerdt, Pascal Weiner |
Splitting Planar Graphs of Girth 6 into Two Linear Forests with Short Paths. ![Search on Bibsonomy](Pics/bibsonomy.png) |
J. Graph Theory ![In: J. Graph Theory 85(3), pp. 601-618, 2017. The full citation details ...](Pics/full.jpeg) |
2017 |
DBLP DOI BibTeX RDF |
|
15 | Micha A. Perles, Horst Martini, Yaakov S. Kupitz |
Locally 3-Transitive Graphs of Girth 4. ![Search on Bibsonomy](Pics/bibsonomy.png) |
J. Graph Theory ![In: J. Graph Theory 84(4), pp. 512-520, 2017. The full citation details ...](Pics/full.jpeg) |
2017 |
DBLP DOI BibTeX RDF |
|
15 | Ho-Jin Choi, Ilkyoo Choi, Jisu Jeong, Geewon Suh |
(1, k)-Coloring of Graphs with Girth at Least Five on a Surface. ![Search on Bibsonomy](Pics/bibsonomy.png) |
J. Graph Theory ![In: J. Graph Theory 84(4), pp. 521-535, 2017. The full citation details ...](Pics/full.jpeg) |
2017 |
DBLP DOI BibTeX RDF |
|
15 | Chun-Hung Liu, Luke Postle |
On the Minimum Edge-Density of 4-Critical Graphs of Girth Five. ![Search on Bibsonomy](Pics/bibsonomy.png) |
J. Graph Theory ![In: J. Graph Theory 86(4), pp. 387-405, 2017. The full citation details ...](Pics/full.jpeg) |
2017 |
DBLP DOI BibTeX RDF |
|
15 | Gunnar Brinkmann, Jan Goedgebeur |
Generation of Cubic Graphs and Snarks with Large Girth. ![Search on Bibsonomy](Pics/bibsonomy.png) |
J. Graph Theory ![In: J. Graph Theory 86(2), pp. 255-272, 2017. The full citation details ...](Pics/full.jpeg) |
2017 |
DBLP DOI BibTeX RDF |
|
15 | Somsak Choomchuay |
A simple design for large girth LDPC matrix. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ISCIT ![In: 17th International Symposium on Communications and Information Technologies, ISCIT 2017, Cairns, Australia, September 25-27, 2017, pp. 1-4, 2017, IEEE, 978-1-5090-6514-1. The full citation details ...](Pics/full.jpeg) |
2017 |
DBLP DOI BibTeX RDF |
|
15 | Alessio Conte, Kazuhiro Kurita, Kunihiro Wasa, Takeaki Uno |
Listing Acyclic Subgraphs and Subgraphs of Bounded Girth in Directed Graphs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
COCOA (2) ![In: Combinatorial Optimization and Applications - 11th International Conference, COCOA 2017, Shanghai, China, December 16-18, 2017, Proceedings, Part II, pp. 169-181, 2017, Springer, 978-3-319-71146-1. The full citation details ...](Pics/full.jpeg) |
2017 |
DBLP DOI BibTeX RDF |
|
15 | Encarnación Abajo, Gabriela Araujo-Pardo, Camino Balbuena, Manuel Bendala |
New family of small regular graphs of girth 5. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Electron. Notes Discret. Math. ![In: Electron. Notes Discret. Math. 54, pp. 139-144, 2016. The full citation details ...](Pics/full.jpeg) |
2016 |
DBLP DOI BibTeX RDF |
|
15 | Ana Silva 0001, Cláudia Linhares Sales |
Graphs with large girth are b-continuous. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Electron. Notes Discret. Math. ![In: Electron. Notes Discret. Math. 55, pp. 101-104, 2016. The full citation details ...](Pics/full.jpeg) |
2016 |
DBLP DOI BibTeX RDF |
|
15 | Tatiana Baginová Jajcayová, Slobodan Filipovski, Robert Jajcay |
Improved Lower Bounds for the Orders of Even Girth Cages. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Electron. J. Comb. ![In: Electron. J. Comb. 23(3), pp. 3, 2016. The full citation details ...](Pics/full.jpeg) |
2016 |
DBLP DOI BibTeX RDF |
|
15 | Peter Hudák, Mária Maceková, Tomás Madaras, Pavol Siroczki |
Light graphs in planar graphs of large girth. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Discuss. Math. Graph Theory ![In: Discuss. Math. Graph Theory 36(1), pp. 227-238, 2016. The full citation details ...](Pics/full.jpeg) |
2016 |
DBLP DOI BibTeX RDF |
|
15 | Jianrong Bao, Dan He, Bin Jiang 0008, Xianghong Tang |
High Rate QC-LDPC Codes with Optimization of Maximum Average Girth. ![Search on Bibsonomy](Pics/bibsonomy.png) |
J. Commun. ![In: J. Commun. 11(10), pp. 936-943, 2016. The full citation details ...](Pics/full.jpeg) |
2016 |
DBLP DOI BibTeX RDF |
|
15 | Michael Dinitz, Guy Kortsarz, Ran Raz |
Label Cover Instances with Large Girth and the Hardness of Approximating Basic k-Spanner. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ACM Trans. Algorithms ![In: ACM Trans. Algorithms 12(2), pp. 25:1-25:16, 2016. The full citation details ...](Pics/full.jpeg) |
2016 |
DBLP DOI BibTeX RDF |
|
15 | Ross J. Kang, François Pirot |
Coloring Powers and Girth. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SIAM J. Discret. Math. ![In: SIAM J. Discret. Math. 30(4), pp. 1938-1949, 2016. The full citation details ...](Pics/full.jpeg) |
2016 |
DBLP DOI BibTeX RDF |
|
15 | Tilen Marc |
There are no finite partial cubes of girth more than 6 and minimum degree at least 3. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Eur. J. Comb. ![In: Eur. J. Comb. 55, pp. 62-72, 2016. The full citation details ...](Pics/full.jpeg) |
2016 |
DBLP DOI BibTeX RDF |
|
15 | Ioan Tomescu |
On the general sum-connectivity index of connected graphs with given order and girth. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Electron. J. Graph Theory Appl. ![In: Electron. J. Graph Theory Appl. 4(1), pp. 1-7, 2016. The full citation details ...](Pics/full.jpeg) |
2016 |
DBLP DOI BibTeX RDF |
|
15 | M. A. Shalu, T. P. Sandhya 0001 |
Star Coloring of Graphs with Girth at Least Five. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Graphs Comb. ![In: Graphs Comb. 32(5), pp. 2121-2134, 2016. The full citation details ...](Pics/full.jpeg) |
2016 |
DBLP DOI BibTeX RDF |
|
15 | Zhengke Miao, Xiaofeng Wang, Cun-Quan Zhang |
Hamilton Circuits and Essential Girth of Claw Free Graphs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Graphs Comb. ![In: Graphs Comb. 32(1), pp. 311-321, 2016. The full citation details ...](Pics/full.jpeg) |
2016 |
DBLP DOI BibTeX RDF |
|
15 | T. H. Marshall |
An Oriented 6-Coloring of Planar Graphs with Girth at Least 9. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Graphs Comb. ![In: Graphs Comb. 32(3), pp. 1101-1116, 2016. The full citation details ...](Pics/full.jpeg) |
2016 |
DBLP DOI BibTeX RDF |
|
15 | Matthew D. Williamson, K. Subramani 0001 |
Corrigendum to "On the negative cost girth problem in planar networks" [Journal of Discrete Algorithms 35 (2015) 40-50]. ![Search on Bibsonomy](Pics/bibsonomy.png) |
J. Discrete Algorithms ![In: J. Discrete Algorithms 38-41, pp. 52-53, 2016. The full citation details ...](Pics/full.jpeg) |
2016 |
DBLP DOI BibTeX RDF |
|
15 | Ambar Bajpai, Gan Srirutchataboon, Piya Kovintavewat, Lunchakorn Wuttisittikulkij |
A New Construction Method for Large Girth Quasi-Cyclic LDPC Codes with Optimized Lower Bound using Chinese Remainder Theorem. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Wirel. Pers. Commun. ![In: Wirel. Pers. Commun. 91(1), pp. 369-381, 2016. The full citation details ...](Pics/full.jpeg) |
2016 |
DBLP DOI BibTeX RDF |
|
15 | Alireza Tasdighi, Amir H. Banihashemi, Mohammad-Reza Sadeghi 0001 |
Efficient Search of Girth-Optimal QC-LDPC Codes. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IEEE Trans. Inf. Theory ![In: IEEE Trans. Inf. Theory 62(4), pp. 1552-1564, 2016. The full citation details ...](Pics/full.jpeg) |
2016 |
DBLP DOI BibTeX RDF |
|
15 | Endre Csóka |
Independent sets and cuts in large-girth regular graphs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/1602.02747, 2016. The full citation details ...](Pics/full.jpeg) |
2016 |
DBLP BibTeX RDF |
|
15 | Randy Davila, Thomas Kalinowski, Sudeep Stephen |
Proof of a conjecture of Davila and Kenter regarding a lower bound for the forcing number in terms of girth and minimum degree. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/1611.06557, 2016. The full citation details ...](Pics/full.jpeg) |
2016 |
DBLP BibTeX RDF |
|
15 | Ana Silva 0001, Cláudia Linhares Sales |
Graphs with Large Girth are b-continuous. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/1602.01298, 2016. The full citation details ...](Pics/full.jpeg) |
2016 |
DBLP BibTeX RDF |
|
15 | Jakub Pachocki, Liam Roditty, Aaron Sidford, Roei Tov, Virginia Vassilevska Williams |
Approximating Cycles in Directed Graphs: Fast Algorithms for Girth and Roundtrip Spanners. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/1611.00721, 2016. The full citation details ...](Pics/full.jpeg) |
2016 |
DBLP BibTeX RDF |
|
15 | Ruyan Wang, Yong Li, Hui Zhao 0012, Liang Qin, Hong Zhang 0012 |
Construction of girth-eight quasi-cyclic low-density parity-check codes with low encoding complexity. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IET Commun. ![In: IET Commun. 10(2), pp. 148-153, 2016. The full citation details ...](Pics/full.jpeg) |
2016 |
DBLP DOI BibTeX RDF |
|
15 | Wuyang Sun |
p-Factor-Criticality of Vertex-Transitive Graphs with Large Girth. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Ars Comb. ![In: Ars Comb. 127, pp. 89-100, 2016. The full citation details ...](Pics/full.jpeg) |
2016 |
DBLP BibTeX RDF |
|
15 | François Dross, Mickaël Montassier, Alexandre Pinlou |
A lower bound on the order of the largest induced forest in planar graphs with high girth. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Discret. Appl. Math. ![In: Discret. Appl. Math. 214, pp. 99-107, 2016. The full citation details ...](Pics/full.jpeg) |
2016 |
DBLP DOI BibTeX RDF |
|
15 | Gang Ma 0005, Shengjin Ji, Qiuju Bian, Xia Li |
The maximum matching energy of bicyclic graphs with even girth. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Discret. Appl. Math. ![In: Discret. Appl. Math. 206, pp. 203-210, 2016. The full citation details ...](Pics/full.jpeg) |
2016 |
DBLP DOI BibTeX RDF |
|
15 | Brian G. Kronenthal, Felix Lazebnik |
On the uniqueness of some girth eight algebraically defined graphs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Discret. Appl. Math. ![In: Discret. Appl. Math. 206, pp. 188-194, 2016. The full citation details ...](Pics/full.jpeg) |
2016 |
DBLP DOI BibTeX RDF |
|
15 | Huimin Song, Hong-Jian Lai, Jian-Liang Wu |
On r-hued coloring of planar graphs with girth at least 6. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Discret. Appl. Math. ![In: Discret. Appl. Math. 198, pp. 251-263, 2016. The full citation details ...](Pics/full.jpeg) |
2016 |
DBLP DOI BibTeX RDF |
|
15 | Ali Mohammadian |
A generalization of the odd-girth theorem. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Discret. Math. ![In: Discret. Math. 339(2), pp. 1052-1057, 2016. The full citation details ...](Pics/full.jpeg) |
2016 |
DBLP DOI BibTeX RDF |
|
15 | Stanislav Jendrol', Mária Maceková, Mickaël Montassier, Roman Soták |
Optimal unavoidable sets of types of 3-paths for planar graphs of given girth. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Discret. Math. ![In: Discret. Math. 339(2), pp. 780-789, 2016. The full citation details ...](Pics/full.jpeg) |
2016 |
DBLP DOI BibTeX RDF |
|
15 | Gabriela Araujo-Pardo, Geoffrey Exoo, Robert Jajcay |
Small bi-regular graphs of even girth. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Discret. Math. ![In: Discret. Math. 339(2), pp. 658-667, 2016. The full citation details ...](Pics/full.jpeg) |
2016 |
DBLP DOI BibTeX RDF |
|
15 | Hongyu Chen, Jian-Liang Wu |
List injective coloring of planar graphs with girth g≥6. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Discret. Math. ![In: Discret. Math. 339(12), pp. 3043-3051, 2016. The full citation details ...](Pics/full.jpeg) |
2016 |
DBLP DOI BibTeX RDF |
|
15 | Xiaoyan Cheng, Wenbing Chen, Yuansheng Tang |
On the conjecture for the girth of the bipartite graph D(k, q). ![Search on Bibsonomy](Pics/bibsonomy.png) |
Discret. Math. ![In: Discret. Math. 339(9), pp. 2384-2392, 2016. The full citation details ...](Pics/full.jpeg) |
2016 |
DBLP DOI BibTeX RDF |
|