Search results for "girth"

Hits ?▲	Authors	Title	Venue	Year	Link
15	Roxana Smarandache, David G. M. Mitchell	Necessary and Sufficient Girth Conditions for Tanner Graphs of Quasi-Cyclic LDPC Codes.	ISIT	2021	DBLP DOI BibTeX RDF
15	Anthony Gómez-Fonseca, Roxana Smarandache, David G. M. Mitchell	Necessary and Sufficient Girth Conditions for LDPC Tanner Graphs with Denser Protographs.	ISTC	2021	DBLP DOI BibTeX RDF
15	Saeed Akhoondian Amiri, Ben Wiederhake	Distributed Distance-r Covering Problems on Sparse High-Girth Graphs.	CIAC	2021	DBLP DOI BibTeX RDF
15	Hengzhou Xu, Hai Zhu 0001, Xiaoxiao Miao, Mengmeng Xu, Zhen Luo, Huaan Li	A Short Note on the Girth of Tanner (5, 13)-Regular QC-LDPC Codes.	CIS	2021	DBLP DOI BibTeX RDF
15	Zdenek Dvorák 0001, Daniel Král', Robin Thomas 0001	Three-coloring triangle-free graphs on surfaces III. Graphs of girth five.	J. Comb. Theory, Ser. B	2020	DBLP DOI BibTeX RDF
15	Axel Brandt, Sogol Jahanbekam, Jennifer White	Additive list coloring of planar graphs with given girth.	Discuss. Math. Graph Theory	2020	DBLP DOI BibTeX RDF
15	Lei Yang 0050, Qianqian Huang, Xiaowei Song 0001, Menglong Li, Chunping Hou, Zixiang Xiong	Girth Measurement Based on Multi-View Stereo Images for Garment Design.	IEEE Access	2020	DBLP DOI BibTeX RDF
15	Jian Li 0042, Mingze Li, Xinjing Huang, Hao Feng 0003, Xiaobo Rui, Yu Zhang 0078	Crosspoint Localization of Spiral and Girth Welds of Spiral Steel Pipelines.	IEEE Access	2020	DBLP DOI BibTeX RDF
15	Jasvinder Singh, Manish Gupta 0011, Jaskarn Singh Bhullar	On the search of smallest QC-LDPC code with girth six and eight.	Cryptogr. Commun.	2020	DBLP DOI BibTeX RDF
15	Zdenek Dvorák 0001, Xiaolan Hu	(3a: a)-List-Colorability of Embedded Graphs of Girth at Least Five.	SIAM J. Discret. Math.	2020	DBLP DOI BibTeX RDF
15	Zdenek Dvorák 0001, Xiaolan Hu	Fractional Coloring of Planar Graphs of Girth Five.	SIAM J. Discret. Math.	2020	DBLP DOI BibTeX RDF
15	Jasvinder Singh, Manish Gupta 0011, Jaskarn Singh Bhullar	Construction of girth-8 (3, L)-QC-LDPC codes of smallest CPM size using column multipliers.	Des. Codes Cryptogr.	2020	DBLP DOI BibTeX RDF
15	Héctor Castañeda-López, Pablo C. Palomino, Andrea B. Ramos-Tort, Christian Rubio-Montiel, Claudia Silva-Ruiz	The 6-girth-thickness of the complete graph.	AKCE Int. J. Graphs Comb.	2020	DBLP DOI BibTeX RDF
15	Éric Fusy, Benjamin Lévêque	Orientations and bijections for toroidal maps with prescribed face-degrees and essential girth.	J. Comb. Theory, Ser. A	2020	DBLP DOI BibTeX RDF
15	Ali Dehghan 0001, Amir H. Banihashemi	On Finding Bipartite Graphs With a Small Number of Short Cycles and Large Girth.	IEEE Trans. Inf. Theory	2020	DBLP DOI BibTeX RDF
15	Alireza Tasdighi, Emmanuel Boutillon	Integer Ring Sieve (IRS) for Constructing Compact QC-LDPC Codes with Large Girth.	CoRR	2020	DBLP BibTeX RDF
15	Theo McKenzie, Sidhanth Mohanty	High-girth near-Ramanujan graphs with lossy vertex expansion.	CoRR	2020	DBLP BibTeX RDF
15	Mina Dalirrooyfard, Virginia Vassilevska Williams	Conditionally optimal approximation algorithms for the girth of a directed graph.	CoRR	2020	DBLP BibTeX RDF
15	Peter Bradshaw, Seyyed Aliasghar Hosseini, Bojan Mohar, Ladislav Stacho	On the cop number of graphs of high girth.	CoRR	2020	DBLP BibTeX RDF
15	Fotis Iliopoulos	Girth-reducibility and the algorithmic barrier for coloring.	CoRR	2020	DBLP BibTeX RDF
15		1-planar graphs with minimum degree at least 3 have bounded girth.	CoRR	2020	DBLP BibTeX RDF
15	Valentin Bartier, Nicolas Bousquet, Clément Dallard, Kyle Lomer, Amer E. Mouawad	On girth and the parameterized complexity of token sliding and token jumping.	CoRR	2020	DBLP BibTeX RDF
15	Wei Dong	L(p, q)-labeling of planar graphs with small girth.	Discret. Appl. Math.	2020	DBLP DOI BibTeX RDF
15	Axel Brandt, Nathan Tenpas, Carl R. Yerger	Planar graphs with girth 20 are additively 3-choosable.	Discret. Appl. Math.	2020	DBLP DOI BibTeX RDF
15	Raphael Steiner	A note on coloring digraphs of large girth.	Discret. Appl. Math.	2020	DBLP DOI BibTeX RDF
15	Allen Ibiapina, Ana Silva 0001	b-continuity and partial Grundy coloring of graphs with large girth.	Discret. Math.	2020	DBLP DOI BibTeX RDF
15	Ming Li, Xia Zhang	Relaxed equitable colorings of planar graphs with girth at least 8.	Discret. Math.	2020	DBLP DOI BibTeX RDF
15	Ngo Dac Tan	On 3-regular digraphs of girth 4.	Discret. Math.	2020	DBLP DOI BibTeX RDF
15	Shiyuan Mo, Li Chen 0013, Daniel J. Costello Jr., David G. M. Mitchell, Roxana Smarandache, Jie Qiu	Designing Protograph-Based Quasi-Cyclic Spatially Coupled LDPC Codes With Large Girth.	IEEE Trans. Commun.	2020	DBLP DOI BibTeX RDF
15	Xinyue Zhang, Gang Liu, Ling Jing, Siyao Chen	Automated Measurement of Heart Girth for Pigs Using Two Kinect Depth Sensors.	Sensors	2020	DBLP DOI BibTeX RDF
15	Michael Krivelevich, Eyal Lubetzky, Benny Sudakov	Asymptotics in percolation on high-girth expanders.	Random Struct. Algorithms	2020	DBLP DOI BibTeX RDF
15	Marjan Majdzade, Mohammad Gholami	On the Class of High-Rate QC-LDPC Codes With Girth 8 From Sequences Satisfied in GCD Condition.	IEEE Commun. Lett.	2020	DBLP DOI BibTeX RDF
15	Zdenek Dvorák 0001, Tomás Masarík, Jan Musílek, Ondrej Pangrác	Flexibility of planar graphs of girth at least six.	J. Graph Theory	2020	DBLP DOI BibTeX RDF
15	József Balogh, Lina Li	On the number of linear hypergraphs of large girth.	J. Graph Theory	2020	DBLP DOI BibTeX RDF
15	Valentin Bartier, Nicolas Bousquet, Clément Dallard, Kyle Lomer, Amer E. Mouawad	On Girth and the Parameterized Complexity of Token Sliding and Token Jumping.	ISAAC	2020	DBLP DOI BibTeX RDF
15	Laurent Beaudou, Florent Foucaud, Reza Naserasr	Smallest C2l+1-Critical Graphs of Odd-Girth 2k+1.	CALDAM	2020	DBLP DOI BibTeX RDF
15	Mina Dalirrooyfard, Virginia Vassilevska Williams	Conditionally Optimal Approximation Algorithms for the Girth of a Directed Graph.	ICALP	2020	DBLP DOI BibTeX RDF
15	Keren Censor-Hillel, Orr Fischer, Tzlil Gonen, François Le Gall, Dean Leitersdorf, Rotem Oshman	Fast Distributed Algorithms for Girth, Cycles and Small Subgraphs.	DISC	2020	DBLP DOI BibTeX RDF
15	Inseon Kim, Hong-Yeop Song	A simple construction for QC-LDPC codes of short lengths with girth at least 8.	ICTC	2020	DBLP DOI BibTeX RDF
15	Aleksei V. Kharin, Aleksei Dryakhlov, Evgeny Mirokhin, Konstantin Zavertkin, Aleksei Ovinnikov, Evgeny Likhobabin	An Approach to the Generation of Regular QC-LDPC Codes with Girth 8.	MECO	2020	DBLP DOI BibTeX RDF
15	Toru Hasunuma	Connectivity Keeping Trees in 2-Connected Graphs with Girth Conditions.	IWOCA	2020	DBLP DOI BibTeX RDF
15	Shiri Chechik, Yang P. Liu, Omer Rotem, Aaron Sidford	Constant girth approximation for directed graphs in subquadratic time.	STOC	2020	DBLP DOI BibTeX RDF
15	Haiyang Zhu, Junlei Zhu, Ying Liu, Shuling Wang, Danjun Huang, Lianying Miao	The List L(2, 1)-Labeling of Planar Graphs with Large Girth.	AAIM	2020	DBLP DOI BibTeX RDF
15	Ross J. Kang, Willem van Loon	Tree-Like Distance Colouring for Planar Graphs of Sufficient Girth.	Electron. J. Comb.	2019	DBLP DOI BibTeX RDF
15	Ke Wang, Dehai Zhu, Hao Guo 0005, Qin Ma 0001, Wei Su 0003, Yang Su	Automated calculation of heart girth measurement in pigs using body surface point clouds.	Comput. Electron. Agric.	2019	DBLP DOI BibTeX RDF
15	Allen Ibiapina, Ana Silva 0001	Graphs with Girth at Least 8 are b-continuous.	LAGOS	2019	DBLP DOI BibTeX RDF
15	Andreas M. Tillmann	Computing the spark: mixed-integer programming for the (vector) matroid girth problem.	Comput. Optim. Appl.	2019	DBLP DOI BibTeX RDF
15	Hengzhou Xu, Huaan Li, Dan Feng 0002, Bo Zhang 0053, Hai Zhu 0001	On the Girth of Tanner (3, 13) Quasi-Cyclic LDPC Codes.	IEEE Access	2019	DBLP DOI BibTeX RDF
15	Hengzhou Xu, Huaan Li, Baoming Bai, Min Zhu 0003, Bo Zhang 0053	Tanner (J, L) Quasi-Cyclic LDPC Codes: Girth Analysis and Derived Codes.	IEEE Access	2019	DBLP DOI BibTeX RDF
15	Hengzhou Xu, Yake Duan, Xiaoxiao Miao, Hai Zhu 0001	Girth Analysis of Tanner's (3, 17)-Regular QC-LDPC Codes Based on Euclidean Division Algorithm.	IEEE Access	2019	DBLP DOI BibTeX RDF
15	Geoffrey Exoo, Jan Goedgebeur	Bounds for the smallest k-chromatic graphs of given girth.	Discret. Math. Theor. Comput. Sci.	2019	DBLP DOI BibTeX RDF
15	László Csirmaz, Péter Ligeti	Secret sharing on large girth graphs.	Cryptogr. Commun.	2019	DBLP DOI BibTeX RDF
15	Ruifang Liu, Hong-Jian Lai, Yingzhi Tian, Yang Wu 0007	Vertex-connectivity and eigenvalues of graphs with fixed girth.	Appl. Math. Comput.	2019	DBLP DOI BibTeX RDF
15	Neil Robertson 0001, Paul D. Seymour, Robin Thomas 0001	Girth Six Cubic Graphs Have Petersen Minors.	Comb.	2019	DBLP DOI BibTeX RDF
15	Hoàng-Oanh Le, Van Bang Le	Map graphs having witnesses of large girth.	Theor. Comput. Sci.	2019	DBLP DOI BibTeX RDF
15	Jorge Cervantes-Ojeda, María del Carmen Gómez Fuentes, Diego González-Moreno, Mika Olsen	Rainbow Connectivity Using a Rank Genetic Algorithm: Moore Cages with Girth Six.	J. Appl. Math.	2019	DBLP DOI BibTeX RDF
15	Christian Rubio-Montiel	The 4-girth-thickness of the complete multipartite graph.	Electron. J. Graph Theory Appl.	2019	DBLP DOI BibTeX RDF
15	Weizhi Lu, Weiyu Li, Wei Zhang 0021, Shu-Tao Xia	Expander Recovery Performance of Bipartite Graphs With Girth Greater Than 4.	IEEE Trans. Signal Inf. Process. over Networks	2019	DBLP DOI BibTeX RDF
15	Saieed Akbari, Tínaz Ekim, Amir Hossein Ghodrati, Sanaz Zare	Well-indumatched Trees and Graphs of Bounded Girth.	CoRR	2019	DBLP BibTeX RDF
15	Noga Alon, Shirshendu Ganguly, Nikhil Srivastava	High-girth near-Ramanujan graphs with localized eigenvectors.	CoRR	2019	DBLP BibTeX RDF
15	Eustrat Zhupa, Monika K. Polak	Keyed hash function from large girth expander graphs.	CoRR	2019	DBLP BibTeX RDF
15	Zdenek Dvorák 0001, Tomás Masarík, Jan Musílek, Ondrej Pangrác	Flexibility of planar graphs of girth at least six.	CoRR	2019	DBLP BibTeX RDF
15	Tomás Feder, Pavol Hell, Carlos S. Subi	Complexity of acyclic colorings of graphs and digraphs with degree and girth constraints.	CoRR	2019	DBLP BibTeX RDF
15	Allen Ibiapina, Ana Silva 0001	b-continuity and Partial Grundy Coloring of graphs with large girth.	CoRR	2019	DBLP BibTeX RDF
15	Saeed Akhoondian Amiri, Ben Wiederhake	Distributed Distance-r Dominating Set on Sparse High-Girth Graphs.	CoRR	2019	DBLP BibTeX RDF
15	Haim Kaplan, Katharina Klost, Wolfgang Mulzer, Liam Roditty, Paul Seiferth, Micha Sharir	Triangles and Girth in Disk Graphs and Transmission Graphs.	CoRR	2019	DBLP BibTeX RDF
15	Shiri Chechik, Yang P. Liu, Omer Rotem, Aaron Sidford	Improved Girth Approximation and Roundtrip Spanners.	CoRR	2019	DBLP BibTeX RDF
15	Jess Banks, Luca Trevisan	Vector Colorings of Random, Ramanujan, and Large-Girth Irregular Graphs.	CoRR	2019	DBLP BibTeX RDF
15	Brian G. Kronenthal, Felix Lazebnik, Jason Williford	On the uniqueness of some girth eight algebraically defined graphs, Part II.	Discret. Appl. Math.	2019	DBLP DOI BibTeX RDF
15	François Dross, Mickaël Montassier, Alexandre Pinlou	Large induced forests in planar graphs with girth 4.	Discret. Appl. Math.	2019	DBLP DOI BibTeX RDF
15	Verónica Hernández, Domingo Pestana, José M. Rodríguez 0001	Several extremal problems on graphs involving the circumference, girth, and hyperbolicity constant.	Discret. Appl. Math.	2019	DBLP DOI BibTeX RDF
15	Lei Zhang, Shiying Wang	Sufficient conditions for graphs with girth g to be maximally k-restricted edge connected.	Discret. Appl. Math.	2019	DBLP DOI BibTeX RDF
15	Kai Lin, Min Chen 0012, Dong Chen 0012	(1, 0)-Relaxed strong edge list coloring of planar graphs with girth 6.	Discret. Math. Algorithms Appl.	2019	DBLP DOI BibTeX RDF
15	Allison J. Ganger, Shannon N. Golden, Brian G. Kronenthal, Carter A. Lyons	On the girth of two-dimensional real algebraically defined graphs.	Discret. Math.	2019	DBLP DOI BibTeX RDF
15	Ilkyoo Choi, Gexin Yu, Xia Zhang	Planar graphs with girth at least 5 are (3, 4)-colorable.	Discret. Math.	2019	DBLP DOI BibTeX RDF
15	Lily Chen, Kecai Deng, Gexin Yu, Xiangqian Zhou	Strong edge-coloring for planar graphs with large girth.	Discret. Math.	2019	DBLP DOI BibTeX RDF
15	Encarnación Abajo, Camino Balbuena, Manuel Bendala, Xavier Marcote	Improving bounds on the order of regular graphs of girth 5.	Discret. Math.	2019	DBLP DOI BibTeX RDF
15	Tomasz Bartnicki, Bartlomiej Bosek, Sebastian Czerwinski, Michal Farnik, Jaroslaw Grytczuk, Zofia Miechowicz	Generalized arboricity of graphs with large girth.	Discret. Math.	2019	DBLP DOI BibTeX RDF
15	Xin Xiao, Bane Vasic, Shu Lin 0001, Khaled A. S. Abdel-Ghaffar, William E. Ryan	Reed-Solomon Based Quasi-Cyclic LDPC Codes: Designs, Girth, Cycle Structure, and Reduction of Short Cycles.	IEEE Trans. Commun.	2019	DBLP DOI BibTeX RDF
15	Guohua Zhang, Yulin Hu, Yi Fang 0005, Juhua Wang	Constructions of Type-II QC-LDPC Codes With Girth Eight from Sidon Sequence.	IEEE Trans. Commun.	2019	DBLP DOI BibTeX RDF
15	Tom Bohman, Lutz Warnke	Large girth approximate Steiner triple systems.	J. Lond. Math. Soc.	2019	DBLP DOI BibTeX RDF
15	Primoz Potocnik, Janos Vidali	Girth-regular graphs.	Ars Math. Contemp.	2019	DBLP DOI BibTeX RDF
15	Xia Guo, Yan Yang	A note on the 4-girth-thickness of Kn, n, n.	Ars Math. Contemp.	2019	DBLP DOI BibTeX RDF
15	B. Praba, X. A. Benazir Obilia	Clique Number and Girth of the Rough Ideal-Based Rough Edge Cayley Graph.	New Math. Nat. Comput.	2019	DBLP DOI BibTeX RDF
15	Károly Harsányi, Péter Ligeti	Exact information ratios for secret sharing on small graphs with girth at least 5.	J. Math. Cryptol.	2019	DBLP DOI BibTeX RDF
15	Marthe Bonamy, Daniel W. Cranston, Luke Postle	Planar graphs of girth at least five are square (Δ + 2)-choosable.	J. Comb. Theory, Ser. B	2019	DBLP DOI BibTeX RDF
15	Guohua Zhang, Yi Fang 0005, Yuanhua Liu	Automatic Verification of GCD Constraint for Construction of Girth-Eight QC-LDPC Codes.	IEEE Commun. Lett.	2019	DBLP DOI BibTeX RDF
15	Sima Naseri, Amir H. Banihashemi	Construction of Girth-8 QC-LDPC Codes Free of Small Trapping Sets.	IEEE Commun. Lett.	2019	DBLP DOI BibTeX RDF
15	Mohammad-Reza Sadeghi 0001	Optimal Search for Girth-8 Quasi Cyclic and Spatially Coupled Multiple-Edge LDPC Codes.	IEEE Commun. Lett.	2019	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.	J. Graph Theory	2019	DBLP DOI BibTeX RDF
15	Yue Hu, Ling Zhao, Ji Li	Scheme for High-rate LDPC Codes Based on Dual-Diagonal Matrix with Girth-6.	IWCMC	2019	DBLP DOI BibTeX RDF
15	Haim Kaplan, Katharina Klost, Wolfgang Mulzer, Liam Roditty, Paul Seiferth, Micha Sharir	Triangles and Girth in Disk Graphs and Transmission Graphs.	ESA	2019	DBLP DOI BibTeX RDF
15	Massimo Battaglioni, Marco Baldi, Franco Chiaraluce, Michael Lentmaier	Girth Properties of Time-Varying SC-LDPC Convolutional Codes.	ISIT	2019	DBLP DOI BibTeX RDF
15	Ali Dehghan 0001, Amir H. Banihashemi	On the Computational Complexity of Finding Bipartite Graphs with a Small Number of Short Cycles and Large Girth.	ITW	2019	DBLP DOI BibTeX RDF
15	Encarnación Abajo, Camino Balbuena, Manuel Bendala	Elliptic semiplanes and regular graphs with girth 5.	Electron. Notes Discret. Math.	2018	DBLP DOI BibTeX RDF
15	Manuel Fernández 0005, Nicholas Sieger, Michael Tait	Maximal Planar Subgraphs of Fixed Girth in Random Graphs.	Electron. J. Comb.	2018	DBLP DOI BibTeX RDF
15	Daniel W. Cranston	Proper Distinguishing Colorings with Few Colors for Graphs with Girth at Least 5.	Electron. J. Comb.	2018	DBLP DOI BibTeX RDF
15	Andrey Kupavskii, Dmitry A. Shabanov	Colourings of Uniform Hypergraphs with Large Girth and Applications.	Comb. Probab. Comput.	2018	DBLP DOI BibTeX RDF
15	Tínaz Ekim, Didem Gözüpek, Ademir Hujdurovic, Martin Milanic	On Almost Well-Covered Graphs of Girth at Least 6.	Discret. Math. Theor. Comput. Sci.	2018	DBLP DOI BibTeX RDF
15	Carlos Hoppen, Nicholas C. Wormald	Local Algorithms, Regular Graphs of Large Girth, and Random Regular Graphs.	Comb.	2018	DBLP DOI BibTeX RDF