Search results for "girth"

Hits ?▲	Authors	Title	Venue	Year	Link
15	Jim Geelen, Rohan Kapadia	Computing Girth and Cogirth in Perturbed Graphic Matroids.	Comb.	2018	DBLP DOI BibTeX RDF
15	Sina Vafi, Narges Rezvani Majid	Combinatorial design-based quasi-cyclic LDPC codes with girth eight.	Digit. Commun. Networks	2018	DBLP DOI BibTeX RDF
15	Robert Jajcay, György Kiss, Stefko Miklavic	Edge-girth-regular graphs.	Eur. J. Comb.	2018	DBLP DOI BibTeX RDF
15	Keaitsuda Maneeruk Nakprasit, Kittikorn Nakprasit	The Game Coloring Number of Planar Graphs with a Specific Girth.	Graphs Comb.	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.	Wirel. Pers. Commun.	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.	CoRR	2018	DBLP BibTeX RDF
15	Geoffrey Exoo, Jan Goedgebeur	Bounds for the smallest k-chromatic graphs of given girth.	CoRR	2018	DBLP BibTeX RDF
15	Ross J. Kang, Willem van Loon	Tree-like distance colouring for planar graphs of sufficient girth.	CoRR	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.	CoRR	2018	DBLP BibTeX RDF
15	Hoàng-Oanh Le, Van Bang Le	Map graphs having witnesses of large girth.	CoRR	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.	CoRR	2018	DBLP BibTeX RDF
15	Shirshendu Ganguly, Nikhil Srivastava	On Non-localization of Eigenvectors of High Girth Graphs.	CoRR	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.	Discret. Appl. Math.	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.	Discret. Appl. Math.	2018	DBLP DOI BibTeX RDF
15	Gholamreza Abrishami, Michael A. Henning	Independent domination in subcubic graphs of girth at least six.	Discret. Math.	2018	DBLP DOI BibTeX RDF
15	Pu Qiao, Xingzhi Zhan	The maximum girth and minimum circumference of graphs with prescribed radius and diameter.	Discret. Math.	2018	DBLP DOI BibTeX RDF
15	Hee Je Cho, Seong-Hun Paeng	Classification of α-Ricci flat graphs with girth at least five.	Discret. Math.	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.	Discret. Math.	2018	DBLP DOI BibTeX RDF
15	Slobodan Filipovski, Robert Jajcay	On the excess of vertex-transitive graphs of given degree and girth.	Discret. Math.	2018	DBLP DOI BibTeX RDF
15	Aleksey N. Glebov	Splitting a planar graph of girth 5 into two forests with trees of small diameter.	Discret. Math.	2018	DBLP DOI BibTeX RDF
15	Ágnes Backhausz, Balázs Szegedy	On large-girth regular graphs and random processes on trees.	Random Struct. Algorithms	2018	DBLP DOI BibTeX RDF
15	Dominic Dotterrer, Larry Guth, Matthew Kahle	2-Complexes with Large 2-Girth.	Discret. Comput. Geom.	2018	DBLP DOI BibTeX RDF
15	Christian Rubio-Montiel	The 4-girth-thickness of the complete graph.	Ars Math. Contemp.	2018	DBLP DOI BibTeX RDF
15	Guillem Perarnau, Will Perkins 0001	Counting independent sets in cubic graphs of given girth.	J. Comb. Theory, Ser. B	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.	IEEE Commun. Lett.	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.	IEEE Commun. Lett.	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.	J. Graph Theory	2018	DBLP DOI BibTeX RDF
15	Jan Goedgebeur, Carol T. Zamfirescu	Infinitely many planar cubic hypohamiltonian graphs of girth 5.	J. Graph Theory	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.	SODA	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.	ITW	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.	ISTC	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.	IWOCA	2018	DBLP DOI BibTeX RDF
15	Vasiliy Usatyuk, Ilya Vorobyev	Simulated Annealing Method for Construction of High-Girth QC-LDPC Codes.	TSP	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.	CIS	2018	DBLP DOI BibTeX RDF
15	Qiang Wang 0008, Tingting Lan	Smart Construct High Girth LDPC Codes Based on Permutation Groups.	CIS	2018	DBLP DOI BibTeX RDF
15	Wouter Cames van Batenburg, Ross J. Kang	Packing two graphs of even girth 10.	Electron. Notes Discret. Math.	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.	Electron. Notes Discret. Math.	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.	Finite Fields Their Appl.	2017	DBLP DOI BibTeX RDF
15	Oleg V. Borodin, Anna O. Ivanova	All tight descriptions of 3-stars in 3-polytopes with girth 5.	Discuss. Math. Graph Theory	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.	IEEE Access	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.	Eur. J. Comb.	2017	DBLP DOI BibTeX RDF
15	Dimitris Chatzidimitriou, Jean-Florent Raymond, Ignasi Sau, Dimitrios M. Thilikos	Minors in graphs of large ϴr-girth.	Eur. J. Comb.	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.	Eur. J. Comb.	2017	DBLP DOI BibTeX RDF
15	József Solymosi, Ching Wong	Cycles in graphs of fixed girth with large size.	Eur. J. Comb.	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.	Theor. Comput. Sci.	2017	DBLP DOI BibTeX RDF
15	Cláudia Linhares Sales, Ana Silva 0001	The b-Continuity of Graphs with Large Girth.	Graphs Comb.	2017	DBLP DOI BibTeX RDF
15	Søren Dahlgaard, Mathias Bæk Tejs Knudsen, Morten Stöckel	New Subquadratic Approximation Algorithms for the Girth.	CoRR	2017	DBLP BibTeX RDF
15	László Csirmaz, Péter Ligeti	Secret sharing on large girth graphs.	CoRR	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.	Ars Comb.	2017	DBLP BibTeX RDF
15	Mustapha Aouchiche, Pierre Hansen	Proximity, remoteness and girth in graphs.	Discret. Appl. Math.	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.	Discret. Appl. Math.	2017	DBLP DOI BibTeX RDF
15	Wei Dong, Wensong Lin	On 2-distance coloring of plane graphs with girth 5.	Discret. Appl. Math.	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.	Discret. Math.	2017	DBLP DOI BibTeX RDF
15	Encarnación Abajo, Gabriela Araujo-Pardo, Camino Balbuena, Manuel Bendala	New small regular graphs of girth 5.	Discret. Math.	2017	DBLP DOI BibTeX RDF
15	Clément Charpentier	The coloring game on planar graphs with large girth, by a result on sparse cactuses.	Discret. Math.	2017	DBLP DOI BibTeX RDF
15	Alireza Tasdighi, Amir H. Banihashemi, Mohammad-Reza Sadeghi 0001	Symmetrical Constructions for Regular Girth-8 QC-LDPC Codes.	IEEE Trans. Commun.	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.	Sensors	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.	Random Struct. Algorithms	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.	J. Comb. Optim.	2017	DBLP DOI BibTeX RDF
15	Wei Dong, Baogang Xu	2-Distance coloring of planar graphs with girth 5.	J. Comb. Optim.	2017	DBLP DOI BibTeX RDF
15	Amir Daneshgar, Meysam Madani	On the odd girth and the circular chromatic number of generalized Petersen graphs.	J. Comb. Optim.	2017	DBLP DOI BibTeX RDF
15	Guohua Zhang, Rudolf Mathar	Explicit Constructions for Type-1 QC-LDPC Codes With Girth 12.	IEEE Commun. Lett.	2017	DBLP DOI BibTeX RDF
15	Brendan D. McKay	Hypohamiltonian Planar Cubic Graphs with Girth 5.	J. Graph Theory	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.	J. Graph Theory	2017	DBLP DOI BibTeX RDF
15	Micha A. Perles, Horst Martini, Yaakov S. Kupitz	Locally 3-Transitive Graphs of Girth 4.	J. Graph Theory	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.	J. Graph Theory	2017	DBLP DOI BibTeX RDF
15	Chun-Hung Liu, Luke Postle	On the Minimum Edge-Density of 4-Critical Graphs of Girth Five.	J. Graph Theory	2017	DBLP DOI BibTeX RDF
15	Gunnar Brinkmann, Jan Goedgebeur	Generation of Cubic Graphs and Snarks with Large Girth.	J. Graph Theory	2017	DBLP DOI BibTeX RDF
15	Somsak Choomchuay	A simple design for large girth LDPC matrix.	ISCIT	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.	COCOA (2)	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.	Electron. Notes Discret. Math.	2016	DBLP DOI BibTeX RDF
15	Ana Silva 0001, Cláudia Linhares Sales	Graphs with large girth are b-continuous.	Electron. Notes Discret. Math.	2016	DBLP DOI BibTeX RDF
15	Tatiana Baginová Jajcayová, Slobodan Filipovski, Robert Jajcay	Improved Lower Bounds for the Orders of Even Girth Cages.	Electron. J. Comb.	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.	Discuss. Math. Graph Theory	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.	J. Commun.	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.	ACM Trans. Algorithms	2016	DBLP DOI BibTeX RDF
15	Ross J. Kang, François Pirot	Coloring Powers and Girth.	SIAM J. Discret. Math.	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.	Eur. J. Comb.	2016	DBLP DOI BibTeX RDF
15	Ioan Tomescu	On the general sum-connectivity index of connected graphs with given order and girth.	Electron. J. Graph Theory Appl.	2016	DBLP DOI BibTeX RDF
15	M. A. Shalu, T. P. Sandhya 0001	Star Coloring of Graphs with Girth at Least Five.	Graphs Comb.	2016	DBLP DOI BibTeX RDF
15	Zhengke Miao, Xiaofeng Wang, Cun-Quan Zhang	Hamilton Circuits and Essential Girth of Claw Free Graphs.	Graphs Comb.	2016	DBLP DOI BibTeX RDF
15	T. H. Marshall	An Oriented 6-Coloring of Planar Graphs with Girth at Least 9.	Graphs Comb.	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].	J. Discrete Algorithms	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.	Wirel. Pers. Commun.	2016	DBLP DOI BibTeX RDF
15	Alireza Tasdighi, Amir H. Banihashemi, Mohammad-Reza Sadeghi 0001	Efficient Search of Girth-Optimal QC-LDPC Codes.	IEEE Trans. Inf. Theory	2016	DBLP DOI BibTeX RDF
15	Endre Csóka	Independent sets and cuts in large-girth regular graphs.	CoRR	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.	CoRR	2016	DBLP BibTeX RDF
15	Ana Silva 0001, Cláudia Linhares Sales	Graphs with Large Girth are b-continuous.	CoRR	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.	CoRR	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.	IET Commun.	2016	DBLP DOI BibTeX RDF
15	Wuyang Sun	p-Factor-Criticality of Vertex-Transitive Graphs with Large Girth.	Ars Comb.	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.	Discret. Appl. Math.	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.	Discret. Appl. Math.	2016	DBLP DOI BibTeX RDF
15	Brian G. Kronenthal, Felix Lazebnik	On the uniqueness of some girth eight algebraically defined graphs.	Discret. Appl. Math.	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.	Discret. Appl. Math.	2016	DBLP DOI BibTeX RDF
15	Ali Mohammadian	A generalization of the odd-girth theorem.	Discret. Math.	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.	Discret. Math.	2016	DBLP DOI BibTeX RDF
15	Gabriela Araujo-Pardo, Geoffrey Exoo, Robert Jajcay	Small bi-regular graphs of even girth.	Discret. Math.	2016	DBLP DOI BibTeX RDF
15	Hongyu Chen, Jian-Liang Wu	List injective coloring of planar graphs with girth g≥6.	Discret. Math.	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).	Discret. Math.	2016	DBLP DOI BibTeX RDF