Search results for "girth"

Hits ?▲	Authors	Title	Venue	Year	Link	Author keywords
15	Vadim E. Levit, Eugen Mandrescu	Very Well-Covered Graphs of girth at Least Four and Local Maximum Stable Set Greedoids.	Discret. Math. Algorithms Appl.	2011	DBLP DOI BibTeX RDF
15	Arunkumar Subramanian, Andrew Thangaraj, Matthieu R. Bloch, Steven W. McLaughlin	Strong Secrecy on the Binary Erasure Wiretap Channel Using Large-Girth LDPC Codes.	IEEE Trans. Inf. Forensics Secur.	2011	DBLP DOI BibTeX RDF
15	Manouchehr Zaker	Bounds for chromatic number in terms of even-girth and booksize.	Discret. Math.	2011	DBLP DOI BibTeX RDF
15	Jun-Lin Guo, Yue-Li Wang	3-list-coloring planar graphs of girth 4.	Discret. Math.	2011	DBLP DOI BibTeX RDF
15	Yingqian Wang 0001, Qijun Zhang	Decomposing a planar graph with girth at least 8 into a forest and a matching.	Discret. Math.	2011	DBLP DOI BibTeX RDF
15	Samuele Bandi, Velio Tralli, Andrea Conti 0001, Maddalena Nonato	On Girth Conditioning for Low-Density Parity-Check Codes.	IEEE Trans. Commun.	2011	DBLP DOI BibTeX RDF
15	Gabriela Araujo-Pardo, Camino Balbuena	Constructions of small regular bipartite graphs of girth 6.	Networks	2011	DBLP DOI BibTeX RDF
15	Camino Balbuena, Diego González-Moreno, Julián Salas	Edge-superconnectivity of semiregular cages with odd girth.	Networks	2011	DBLP DOI BibTeX RDF
15	Zhongxun Zhu, Gong Chen	On Merrifield-Simmons index of unicyclic graphs with given girth and prescribed pendent vertices.	Australas. J Comb.	2011	DBLP BibTeX RDF
15	Robert Jajcay, Jozef Sirán	Small vertex-transitive graphs of given degree and girth.	Ars Math. Contemp.	2011	DBLP DOI BibTeX RDF
15	Tomás Kaiser, Andrew D. King, Daniel Král'	Fractional total colourings of graphs of high girth.	J. Comb. Theory, Ser. B	2011	DBLP DOI BibTeX RDF
15	Xiongfei Tao, Lixin Zheng, Weizhong Liu, Dongsheng Liu	Recursive Design of High Girth (2, k) LDPC Codes from (k, k) LDPC Codes.	IEEE Commun. Lett.	2011	DBLP DOI BibTeX RDF
15	Eyal Loz, Martin Macaj, Mirka Miller, Jana Siagiová, Jozef Sirán, Jana Tomanová	Small vertex-transitive and Cayley graphs of girth six and given degree: an algebraic approach.	J. Graph Theory	2011	DBLP DOI BibTeX RDF
15	Christian Löwenstein, Anders Sune Pedersen, Dieter Rautenbach, Friedrich Regen	Independence, odd girth, and average degree.	J. Graph Theory	2011	DBLP DOI BibTeX RDF
15	Matt DeVos, Robert Sámal	High-girth cubic graphs are homomorphic to the Clebsch graph.	J. Graph Theory	2011	DBLP DOI BibTeX RDF
15	Ákos Seress, Eric Swartz	A note on the girth-doubling construction for polygonal graphs.	J. Graph Theory	2011	DBLP DOI BibTeX RDF
15	Domingos Dellamonica Jr., Václav Koubek, Daniel M. Martin, Vojtech Rödl	On a conjecture of Thomassen concerning subgraphs of large girth.	J. Graph Theory	2011	DBLP DOI BibTeX RDF
15	Liam Roditty, Roei Tov	Approximating the Girth.	SODA	2011	DBLP DOI BibTeX RDF
15	Irina E. Bocharova, Florian Hug, Rolf Johannesson, Boris D. Kudryashov, Roman V. Satyukov	Some voltage graph-based LDPC tailbiting codes with large girth.	ISIT	2011	DBLP DOI BibTeX RDF
15	Hosung Park, Seokbeom Hong, Jong-Seon No, Dong-Joon Shin	Protograph design with multiple edges for regular QC LDPC codes having large girth.	ISIT	2011	DBLP DOI BibTeX RDF
15	Patanasak Prompakdee, Watid Phakphisut, Pornchai Supnithi	Quasi Cyclic-LDPC codes based on PEG algorithm with maximized girth property.	ISPACS	2011	DBLP DOI BibTeX RDF
15	David Peleg, Ignasi Sau, Mordechai Shalom	On Approximating the d-Girth of a Graph.	SOFSEM	2011	DBLP DOI BibTeX RDF
15	Hsien-Chih Chang, Hsueh-I Lu	Computing the Girth of a Planar Graph in Linear Time.	COCOON	2011	DBLP DOI BibTeX RDF
15	David Gamarnik, David A. Goldberg 0001	Randomized Greedy Algorithms for Independent Sets and Matchings in Regular Graphs: Exact Results and Finite Girth Corrections.	Comb. Probab. Comput.	2010	DBLP DOI BibTeX RDF
15	Hristo N. Djidjev	A faster algorithm for computing the girth of planar and bounded genus graphs.	ACM Trans. Algorithms	2010	DBLP DOI BibTeX RDF
15	Oren Weimann, Raphael Yuster	Computing the Girth of a Planar Graph in O(n logn) Time.	SIAM J. Discret. Math.	2010	DBLP DOI BibTeX RDF
15	Anna Adamaszek, Michal Adamaszek	Large-Girth Roots of Graphs.	SIAM J. Discret. Math.	2010	DBLP DOI BibTeX RDF
15	Gábor Elek	On the limit of large girth graph sequences.	Comb.	2010	DBLP DOI BibTeX RDF
15	Mingqing Zhai, Guanglong Yu, Jinlong Shu	The Laplacian spectral radius of bicyclic graphs with a given girth.	Comput. Math. Appl.	2010	DBLP DOI BibTeX RDF
15	David Auger	Minimal identifying codes in trees and planar graphs with large girth.	Eur. J. Comb.	2010	DBLP DOI BibTeX RDF
15	Amin Sakzad, Mohammad-Reza Sadeghi 0001, Daniel Panario	Codes with girth 8 Tanner graph representation.	Des. Codes Cryptogr.	2010	DBLP DOI BibTeX RDF
15	Vadim E. Levit, Eugen Mandrescu	Very Well-Covered Graphs of Girth at least Four and Local Maximum Stable Set Greedoids	CoRR	2010	DBLP BibTeX RDF
15	Guohua Zhang, Xinmei Wang	Girth-12 Quasi-Cyclic LDPC Codes with Consecutive Lengths	CoRR	2010	DBLP BibTeX RDF
15	Arunkumar Subramanian, Andrew Thangaraj, Matthieu R. Bloch, Steven W. McLaughlin	Strong Secrecy on the Binary Erasure Wiretap Channel Using Large-Girth LDPC Codes	CoRR	2010	DBLP BibTeX RDF
15	Guihai Yu, Lihua Feng	On the Wiener index of unicyclic graphs with given girth.	Ars Comb.	2010	DBLP BibTeX RDF
15	Siham Bekkai, Mekkia Kouider	On mean distance and girth.	Discret. Appl. Math.	2010	DBLP DOI BibTeX RDF
15	Wei Liu 0002, Nicolas Trotignon	The k-in-a-tree problem for graphs of girth at least k.	Discret. Appl. Math.	2010	DBLP DOI BibTeX RDF
15	Oleg V. Borodin, Min Chen 0012, Anna O. Ivanova, André Raspaud	Acyclic 3-choosability of sparse graphs with girth at least 7.	Discret. Math.	2010	DBLP DOI BibTeX RDF
15	Esmeralda Nastase, Vojtech Rödl, Mark H. Siggers	Note on robust critical graphs with large odd girth.	Discret. Math.	2010	DBLP DOI BibTeX RDF
15	Bing Zhou 0004	On a construction of graphs with high chromatic capacity and large girth.	Discret. Math.	2010	DBLP DOI BibTeX RDF
15	Gabriela Araujo-Pardo	On upper bounds of odd girth cages.	Discret. Math.	2010	DBLP DOI BibTeX RDF
15	Weigang Chen, Liuguo Yin, Jianhua Lu	Minimum distance lower bounds for girth-constrained RA code ensembles.	IEEE Trans. Commun.	2010	DBLP DOI BibTeX RDF
15	Jie Huang 0002, Lei Liu, Wuyang Zhou, Shengli Zhou	Large-Girth Nonbinary QC-LDPC Codes of Various Lengths.	IEEE Trans. Commun.	2010	DBLP DOI BibTeX RDF
15	Zhao Zhang 0002, Qinghai Liu	Sufficient conditions for a graph to be lambdak-optimal with given girth and diameter.	Networks	2010	DBLP DOI BibTeX RDF
15	Yuqing Lin, Hongliang Lu, Yunjian Wu, Qinglin Yu	On superconnectivity of (4, g)-cages with even girth.	Networks	2010	DBLP DOI BibTeX RDF
15	Eric Swartz	A construction of an infinite family of 2-arc transitive polygonal graphs of arbitrary odd girth.	J. Comb. Theory, Ser. A	2010	DBLP DOI BibTeX RDF
15	Alexandr V. Kostochka, Daniel Král', Jean-Sébastien Sereni, Michael Stiebitz	Graphs with bounded tree-width and large odd-girth are almost bipartite.	J. Comb. Theory, Ser. B	2010	DBLP DOI BibTeX RDF
15	Martin Kochol	Smallest counterexample to the 5-flow conjecture has girth at least eleven.	J. Comb. Theory, Ser. B	2010	DBLP DOI BibTeX RDF
15	Daniel Král', Edita Mácajová, Ján Mazák, Jean-Sébastien Sereni	Circular edge-colorings of cubic graphs with girth six.	J. Comb. Theory, Ser. B	2010	DBLP DOI BibTeX RDF
15	Flavio Chierichetti, Andrea Vattani	The Local Nature of List Colorings for Graphs of High Girth.	SIAM J. Comput.	2010	DBLP DOI BibTeX RDF
15	Irina E. Bocharova, Florian Hug, Rolf Johannesson, Boris D. Kudryashov, Roman V. Satyukov	New low-density parity-check codes with large girth based on hypergraphs.	ISIT	2010	DBLP DOI BibTeX RDF
15	Hosung Park, Seokbeom Hong, Jong-Seon No, Dong-Joon Shin	Protograph design for QC LDPC codes with large girth.	ICTC	2010	DBLP DOI BibTeX RDF
15	Jun Li 0036, Md. Hashem Ali Khan, Xueqin Jiang 0001, Moon Ho Lee	Hybrid construction of quasi-cyclic low-density parity-check codes with large girth based on euclidean geometries.	ICTC	2010	DBLP DOI BibTeX RDF
15	Anna Adamaszek, Michal Adamaszek	Large-Girth Roots of Graphs.	STACS	2010	DBLP DOI BibTeX RDF
15	Qingji Zheng, Xiangxue Li, Dong Zheng 0001, Baoan Guo	Regular Quasi-cyclic LDPC Codes with Girth 6 from Prime Fields.	IIH-MSP	2010	DBLP DOI BibTeX RDF	quasi-cyclic LDPC, error floor, prime field, Shannon limit
15	Neeldhara Misra, Geevarghese Philip, Venkatesh Raman 0001, Saket Saurabh 0001	The effect of girth on the kernelization complexity of Connected Dominating Set.	FSTTCS	2010	DBLP DOI BibTeX RDF
15	Daniel Král, Edita Mácajová, Ján Mazák, Jean-Sébastien Sereni	Circular edge-colorings of cubic graphs with girth six.	Electron. Notes Discret. Math.	2009	DBLP DOI BibTeX RDF
15	Charles Delorme, Evelyne Flandrin, Yuqing Lin, Mirka Miller, Joe Ryan 0001	On Extremal Graphs with Bounded Girth.	Electron. Notes Discret. Math.	2009	DBLP DOI BibTeX RDF
15	Stephan Brandt, Elizabeth Ribe-Baumann	Graphs of odd girth 7 with large degree.	Electron. Notes Discret. Math.	2009	DBLP DOI BibTeX RDF
15	Hong Yue, Kai Li, Haiwen Zhao, Yi Zhang	Vision-based pipeline girth-welding robot and image processing of weld seam.	Ind. Robot	2009	DBLP DOI BibTeX RDF
15	Dávid Hudák, Tomás Madaras	On local structure of 1-planar graphs of minimum degree 5 and girth 4.	Discuss. Math. Graph Theory	2009	DBLP DOI BibTeX RDF
15	Camino Balbuena	A method for obtaining small regular bipartite graphs of girth 8.	Discret. Math. Theor. Comput. Sci.	2009	DBLP DOI BibTeX RDF
15	Manabu Hagiwara, Marc P. C. Fossorier, Takashi Kitagawa, Hideki Imai	Smallest Size of Circulant Matrix for Regular (3, L) and (4, L) Quasi-Cyclic LDPC Codes with Girth 6.	IEICE Trans. Fundam. Electron. Commun. Comput. Sci.	2009	DBLP DOI BibTeX RDF
15	Ying Zhao, Yang Xiao	The Necessary and Sufficient Condition of a Class of Quasi-Cyclic LDPC Codes without Girth Four.	IEICE Trans. Commun.	2009	DBLP DOI BibTeX RDF
15	Xueqin Jiang 0001, Moon Ho Lee	Large Girth Non-Binary LDPC Codes Based on Finite Fields and Euclidean Geometries.	IEEE Signal Process. Lett.	2009	DBLP DOI BibTeX RDF
15	Oleg V. Borodin, Anna O. Ivanova	List 2-distance (Delta+2)-coloring of planar graphs with girth six.	Eur. J. Comb.	2009	DBLP DOI BibTeX RDF
15	Dongxiao Yu, Jianfeng Hou, Guizhen Liu, Bin Liu 0009, Lan Xu	Acyclic edge coloring of planar graphs with large girth.	Theor. Comput. Sci.	2009	DBLP DOI BibTeX RDF
15	Zhangdong Ouyang, Jing Wang, Yuanqiu Huang	Upper Embeddability, Girth and the Degree-Sum of Nonadjacent Vertices.	Graphs Comb.	2009	DBLP DOI BibTeX RDF
15	Christian Wulff-Nilsen	Girth of a Planar Digraph with Real Edge Weights in O(n(log n)^3) Time	CoRR	2009	DBLP BibTeX RDF
15	Anna Adamaszek, Michal Adamaszek	Large-girth roots of graphs	CoRR	2009	DBLP BibTeX RDF
15	Christian Spagnol, Marta Rossi, Massimiliano Sala	Quasi-cyclic LDPC codes with high girth	CoRR	2009	DBLP BibTeX RDF
15	Xueliang Li 0001, Jianxi Liu	A proof of a conjecture on the Randic index of graphs with given girth.	Discret. Appl. Math.	2009	DBLP DOI BibTeX RDF
15	André Raspaud, Weifan Wang 0001	Linear coloring of planar graphs with large girth.	Discret. Math.	2009	DBLP DOI BibTeX RDF
15	Oleg V. Borodin, Anna O. Ivanova	2-distance (Delta+2)-coloring of planar graphs with girth six and Delta>=18.	Discret. Math.	2009	DBLP DOI BibTeX RDF
15	Xiangwen Li	On 3-choosable planar graphs of girth at least 4.	Discret. Math.	2009	DBLP DOI BibTeX RDF
15	Frédéric Havet	Choosability of the square of planar subcubic graphs with large girth.	Discret. Math.	2009	DBLP DOI BibTeX RDF
15	Louis Esperet, Pascal Ochem	On circle graphs with girth at least five.	Discret. Math.	2009	DBLP DOI BibTeX RDF
15	Alexandre Pinlou	An oriented coloring of planar graphs with girth at least five.	Discret. Math.	2009	DBLP DOI BibTeX RDF
15	Alexander Gamburd, Shlomo Hoory, Mehrdad Shahshahani, Aner Shalev, Bálint Virág	On the girth of random Cayley graphs.	Random Struct. Algorithms	2009	DBLP DOI BibTeX RDF
15	Klavdija Kutnar, Dragan Marusic	A complete classification of cubic symmetric graphs of girth 6.	J. Comb. Theory, Ser. B	2009	DBLP DOI BibTeX RDF
15	Ken-ichi Kawarabayashi, Carsten Thomassen	Decomposing a planar graph of girth 5 into an independent set and a forest.	J. Comb. Theory, Ser. B	2009	DBLP DOI BibTeX RDF
15	Xueqin Jiang 0001, Moon Ho Lee	Large girth quasi-cyclic LDPC codes based on the chinese remainder theorem.	IEEE Commun. Lett.	2009	DBLP DOI BibTeX RDF
15	Wei Meng, Shengjia Li, Yubao Guo, Gaokui Xu	A local tournament contains a vertex whose out-arcs are pseudo-girth-pancyclic.	J. Graph Theory	2009	DBLP DOI BibTeX RDF
15	Fan Zhang 0096, Xuehong Mao, Wuyang Zhou, Henry D. Pfister	Girth-10 LDPC Codes Based on 3-D Cyclic Lattices.	IEEE Trans. Veh. Technol.	2008	DBLP DOI BibTeX RDF
15	Craig Timmons	Star Coloring High Girth Planar Graphs.	Electron. J. Comb.	2008	DBLP BibTeX RDF
15	Qi Liu 0022, Douglas B. West	Tree-Thickness and Caterpillar-Thickness under Girth Constraints.	Electron. J. Comb.	2008	DBLP BibTeX RDF
15	Carlos Hoppen, Nicholas C. Wormald	Induced Forests in Regular Graphs with Large Girth.	Comb. Probab. Comput.	2008	DBLP DOI BibTeX RDF
15	Camino Balbuena	Incidence Matrices of Projective Planes and of Some Regular Bipartite Graphs of Girth 6 with Few Vertices.	SIAM J. Discret. Math.	2008	DBLP DOI BibTeX RDF
15	Zdenek Dvorák 0001, Riste Skrekovski, Tomás Valla	Planar Graphs of Odd-Girth at Least 9 are Homomorphic to the Petersen Graph.	SIAM J. Discret. Math.	2008	DBLP DOI BibTeX RDF
15	Oleg V. Borodin, Alexandr V. Kostochka, Naeem N. Sheikh, Gexin Yu	Decomposing a planar graph with girth 9 into a forest and a matching.	Eur. J. Comb.	2008	DBLP DOI BibTeX RDF
15	Zdenek Dvorák 0001, Daniel Král, Pavel Nejedlý, Riste Skrekovski	Coloring squares of planar graphs with girth six.	Eur. J. Comb.	2008	DBLP DOI BibTeX RDF
15	Michael A. Henning, Anders Yeo	Total Domination in Graphs with Given Girth.	Graphs Comb.	2008	DBLP DOI BibTeX RDF
15	Christian Löwenstein, Dieter Rautenbach	Domination in Graphs of Minimum Degree at least Two and Large Girth.	Graphs Comb.	2008	DBLP DOI BibTeX RDF
15	David Gamarnik, David A. Goldberg 0001	Randomized greedy algorithms for independent sets and matchings in regular graphs: Exact results and finite girth corrections	CoRR	2008	DBLP BibTeX RDF
15	Mohsen Bayati, Andrea Montanari, Amin Saberi	Generating Random Graphs with Large Girth	CoRR	2008	DBLP BibTeX RDF
15		On Mean Distance and Girth	CoRR	2008	DBLP BibTeX RDF
15	Mostafa Esmaeili, Mehdi Gholami	Maximum-girth slope-based quasi-cyclic (2, k ≥ 5) low-density parity-check codes.	IET Commun.	2008	DBLP DOI BibTeX RDF
15	Moo Young Sohn, Xudong Yuan	i?(1)-perfect graphs with girth at least six.	Ars Comb.	2008	DBLP BibTeX RDF
15	Simon Marshall	Another Simple Proof of the High Girth, High Chromatic Number Theorem.	Am. Math. Mon.	2008	DBLP BibTeX RDF
15	Camino Balbuena, Martín Cera, Ana Diánez, Pedro García-Vázquez, Xavier Marcote	Diameter-girth sufficient conditions for optimal extraconnectivity in graphs.	Discret. Math.	2008	DBLP DOI BibTeX RDF