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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Discret. Math. Algorithms Appl. ![In: Discret. Math. Algorithms Appl. 3(2), pp. 245-252, 2011. The full citation details ...](Pics/full.jpeg) |
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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IEEE Trans. Inf. Forensics Secur. ![In: IEEE Trans. Inf. Forensics Secur. 6(3-1), pp. 585-594, 2011. The full citation details ...](Pics/full.jpeg) |
2011 |
DBLP DOI BibTeX RDF |
|
15 | Manouchehr Zaker |
Bounds for chromatic number in terms of even-girth and booksize. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Discret. Math. ![In: Discret. Math. 311(2-3), pp. 197-204, 2011. The full citation details ...](Pics/full.jpeg) |
2011 |
DBLP DOI BibTeX RDF |
|
15 | Jun-Lin Guo, Yue-Li Wang |
3-list-coloring planar graphs of girth 4. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Discret. Math. ![In: Discret. Math. 311(6), pp. 413-417, 2011. The full citation details ...](Pics/full.jpeg) |
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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Discret. Math. ![In: Discret. Math. 311(10-11), pp. 844-849, 2011. The full citation details ...](Pics/full.jpeg) |
2011 |
DBLP DOI BibTeX RDF |
|
15 | Samuele Bandi, Velio Tralli, Andrea Conti 0001, Maddalena Nonato |
On Girth Conditioning for Low-Density Parity-Check Codes. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IEEE Trans. Commun. ![In: IEEE Trans. Commun. 59(2), pp. 357-362, 2011. The full citation details ...](Pics/full.jpeg) |
2011 |
DBLP DOI BibTeX RDF |
|
15 | Gabriela Araujo-Pardo, Camino Balbuena |
Constructions of small regular bipartite graphs of girth 6. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Networks ![In: Networks 57(2), pp. 121-127, 2011. The full citation details ...](Pics/full.jpeg) |
2011 |
DBLP DOI BibTeX RDF |
|
15 | Camino Balbuena, Diego González-Moreno, Julián Salas |
Edge-superconnectivity of semiregular cages with odd girth. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Networks ![In: Networks 58(3), pp. 201-206, 2011. The full citation details ...](Pics/full.jpeg) |
2011 |
DBLP DOI BibTeX RDF |
|
15 | Zhongxun Zhu, Gong Chen |
On Merrifield-Simmons index of unicyclic graphs with given girth and prescribed pendent vertices. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Australas. J Comb. ![In: Australas. J Comb. 50, pp. 87-96, 2011. The full citation details ...](Pics/full.jpeg) |
2011 |
DBLP BibTeX RDF |
|
15 | Robert Jajcay, Jozef Sirán |
Small vertex-transitive graphs of given degree and girth. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Ars Math. Contemp. ![In: Ars Math. Contemp. 4(2), pp. 375-384, 2011. The full citation details ...](Pics/full.jpeg) |
2011 |
DBLP DOI BibTeX RDF |
|
15 | Tomás Kaiser, Andrew D. King, Daniel Král' |
Fractional total colourings of graphs of high girth. ![Search on Bibsonomy](Pics/bibsonomy.png) |
J. Comb. Theory, Ser. B ![In: J. Comb. Theory, Ser. B 101(6), pp. 383-402, 2011. The full citation details ...](Pics/full.jpeg) |
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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IEEE Commun. Lett. ![In: IEEE Commun. Lett. 15(1), pp. 70-72, 2011. The full citation details ...](Pics/full.jpeg) |
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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
J. Graph Theory ![In: J. Graph Theory 68(4), pp. 265-284, 2011. The full citation details ...](Pics/full.jpeg) |
2011 |
DBLP DOI BibTeX RDF |
|
15 | Christian Löwenstein, Anders Sune Pedersen, Dieter Rautenbach, Friedrich Regen |
Independence, odd girth, and average degree. ![Search on Bibsonomy](Pics/bibsonomy.png) |
J. Graph Theory ![In: J. Graph Theory 67(2), pp. 96-111, 2011. The full citation details ...](Pics/full.jpeg) |
2011 |
DBLP DOI BibTeX RDF |
|
15 | Matt DeVos, Robert Sámal |
High-girth cubic graphs are homomorphic to the Clebsch graph. ![Search on Bibsonomy](Pics/bibsonomy.png) |
J. Graph Theory ![In: J. Graph Theory 66(3), pp. 241-259, 2011. The full citation details ...](Pics/full.jpeg) |
2011 |
DBLP DOI BibTeX RDF |
|
15 | Ákos Seress, Eric Swartz |
A note on the girth-doubling construction for polygonal graphs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
J. Graph Theory ![In: J. Graph Theory 68(3), pp. 246-254, 2011. The full citation details ...](Pics/full.jpeg) |
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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
J. Graph Theory ![In: J. Graph Theory 67(4), pp. 316-331, 2011. The full citation details ...](Pics/full.jpeg) |
2011 |
DBLP DOI BibTeX RDF |
|
15 | Liam Roditty, Roei Tov |
Approximating the Girth. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SODA ![In: Proceedings of the Twenty-Second Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2011, San Francisco, California, USA, January 23-25, 2011, pp. 1446-1454, 2011, SIAM, 978-0-89871-993-2. The full citation details ...](Pics/full.jpeg) |
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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ISIT ![In: 2011 IEEE International Symposium on Information Theory Proceedings, ISIT 2011, St. Petersburg, Russia, July 31 - August 5, 2011, pp. 732-736, 2011, IEEE, 978-1-4577-0596-0. The full citation details ...](Pics/full.jpeg) |
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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ISIT ![In: 2011 IEEE International Symposium on Information Theory Proceedings, ISIT 2011, St. Petersburg, Russia, July 31 - August 5, 2011, pp. 918-922, 2011, IEEE, 978-1-4577-0596-0. The full citation details ...](Pics/full.jpeg) |
2011 |
DBLP DOI BibTeX RDF |
|
15 | Patanasak Prompakdee, Watid Phakphisut, Pornchai Supnithi |
Quasi Cyclic-LDPC codes based on PEG algorithm with maximized girth property. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ISPACS ![In: International Symposium on Intelligent Signal Processing and Communications Systems, ISPACS 2011, Chiang Mai, Thailand, December 7-9, 2011, pp. 1-4, 2011, IEEE, 978-1-4577-2165-6. The full citation details ...](Pics/full.jpeg) |
2011 |
DBLP DOI BibTeX RDF |
|
15 | David Peleg, Ignasi Sau, Mordechai Shalom |
On Approximating the d-Girth of a Graph. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SOFSEM ![In: SOFSEM 2011: Theory and Practice of Computer Science - 37th Conference on Current Trends in Theory and Practice of Computer Science, Nový Smokovec, Slovakia, January 22-28, 2011. Proceedings, pp. 467-481, 2011, Springer, 978-3-642-18380-5. The full citation details ...](Pics/full.jpeg) |
2011 |
DBLP DOI BibTeX RDF |
|
15 | Hsien-Chih Chang, Hsueh-I Lu |
Computing the Girth of a Planar Graph in Linear Time. ![Search on Bibsonomy](Pics/bibsonomy.png) |
COCOON ![In: Computing and Combinatorics - 17th Annual International Conference, COCOON 2011, Dallas, TX, USA, August 14-16, 2011. Proceedings, pp. 225-236, 2011, Springer, 978-3-642-22684-7. The full citation details ...](Pics/full.jpeg) |
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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Comb. Probab. Comput. ![In: Comb. Probab. Comput. 19(1), pp. 61-85, 2010. The full citation details ...](Pics/full.jpeg) |
2010 |
DBLP DOI BibTeX RDF |
|
15 | Hristo N. Djidjev |
A faster algorithm for computing the girth of planar and bounded genus graphs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ACM Trans. Algorithms ![In: ACM Trans. Algorithms 7(1), pp. 3:1-3:16, 2010. The full citation details ...](Pics/full.jpeg) |
2010 |
DBLP DOI BibTeX RDF |
|
15 | Oren Weimann, Raphael Yuster |
Computing the Girth of a Planar Graph in O(n logn) Time. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SIAM J. Discret. Math. ![In: SIAM J. Discret. Math. 24(2), pp. 609-616, 2010. The full citation details ...](Pics/full.jpeg) |
2010 |
DBLP DOI BibTeX RDF |
|
15 | Anna Adamaszek, Michal Adamaszek |
Large-Girth Roots of Graphs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SIAM J. Discret. Math. ![In: SIAM J. Discret. Math. 24(4), pp. 1501-1514, 2010. The full citation details ...](Pics/full.jpeg) |
2010 |
DBLP DOI BibTeX RDF |
|
15 | Gábor Elek |
On the limit of large girth graph sequences. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Comb. ![In: Comb. 30(5), pp. 553-563, 2010. The full citation details ...](Pics/full.jpeg) |
2010 |
DBLP DOI BibTeX RDF |
|
15 | Mingqing Zhai, Guanglong Yu, Jinlong Shu |
The Laplacian spectral radius of bicyclic graphs with a given girth. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Comput. Math. Appl. ![In: Comput. Math. Appl. 59(1), pp. 376-381, 2010. The full citation details ...](Pics/full.jpeg) |
2010 |
DBLP DOI BibTeX RDF |
|
15 | David Auger |
Minimal identifying codes in trees and planar graphs with large girth. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Eur. J. Comb. ![In: Eur. J. Comb. 31(5), pp. 1372-1384, 2010. The full citation details ...](Pics/full.jpeg) |
2010 |
DBLP DOI BibTeX RDF |
|
15 | Amin Sakzad, Mohammad-Reza Sadeghi 0001, Daniel Panario |
Codes with girth 8 Tanner graph representation. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Des. Codes Cryptogr. ![In: Des. Codes Cryptogr. 57(1), pp. 71-81, 2010. The full citation details ...](Pics/full.jpeg) |
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 ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/1008.2897, 2010. The full citation details ...](Pics/full.jpeg) |
2010 |
DBLP BibTeX RDF |
|
15 | Guohua Zhang, Xinmei Wang |
Girth-12 Quasi-Cyclic LDPC Codes with Consecutive Lengths ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/1001.3916, 2010. The full citation details ...](Pics/full.jpeg) |
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 ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/1009.3130, 2010. The full citation details ...](Pics/full.jpeg) |
2010 |
DBLP BibTeX RDF |
|
15 | Guihai Yu, Lihua Feng |
On the Wiener index of unicyclic graphs with given girth. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Ars Comb. ![In: Ars Comb. 94, 2010. The full citation details ...](Pics/full.jpeg) |
2010 |
DBLP BibTeX RDF |
|
15 | Siham Bekkai, Mekkia Kouider |
On mean distance and girth. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Discret. Appl. Math. ![In: Discret. Appl. Math. 158(17), pp. 1888-1893, 2010. The full citation details ...](Pics/full.jpeg) |
2010 |
DBLP DOI BibTeX RDF |
|
15 | Wei Liu 0002, Nicolas Trotignon |
The k-in-a-tree problem for graphs of girth at least k. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Discret. Appl. Math. ![In: Discret. Appl. Math. 158(15), pp. 1644-1649, 2010. The full citation details ...](Pics/full.jpeg) |
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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Discret. Math. ![In: Discret. Math. 310(17-18), pp. 2426-2434, 2010. The full citation details ...](Pics/full.jpeg) |
2010 |
DBLP DOI BibTeX RDF |
|
15 | Esmeralda Nastase, Vojtech Rödl, Mark H. Siggers |
Note on robust critical graphs with large odd girth. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Discret. Math. ![In: Discret. Math. 310(3), pp. 499-504, 2010. The full citation details ...](Pics/full.jpeg) |
2010 |
DBLP DOI BibTeX RDF |
|
15 | Bing Zhou 0004 |
On a construction of graphs with high chromatic capacity and large girth. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Discret. Math. ![In: Discret. Math. 310(17-18), pp. 2452-2454, 2010. The full citation details ...](Pics/full.jpeg) |
2010 |
DBLP DOI BibTeX RDF |
|
15 | Gabriela Araujo-Pardo |
On upper bounds of odd girth cages. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Discret. Math. ![In: Discret. Math. 310(10-11), pp. 1622-1626, 2010. The full citation details ...](Pics/full.jpeg) |
2010 |
DBLP DOI BibTeX RDF |
|
15 | Weigang Chen, Liuguo Yin, Jianhua Lu |
Minimum distance lower bounds for girth-constrained RA code ensembles. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IEEE Trans. Commun. ![In: IEEE Trans. Commun. 58(6), pp. 1623-1626, 2010. The full citation details ...](Pics/full.jpeg) |
2010 |
DBLP DOI BibTeX RDF |
|
15 | Jie Huang 0002, Lei Liu, Wuyang Zhou, Shengli Zhou |
Large-Girth Nonbinary QC-LDPC Codes of Various Lengths. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IEEE Trans. Commun. ![In: IEEE Trans. Commun. 58(12), pp. 3436-3447, 2010. The full citation details ...](Pics/full.jpeg) |
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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Networks ![In: Networks 55(2), pp. 119-124, 2010. The full citation details ...](Pics/full.jpeg) |
2010 |
DBLP DOI BibTeX RDF |
|
15 | Yuqing Lin, Hongliang Lu, Yunjian Wu, Qinglin Yu |
On superconnectivity of (4, g)-cages with even girth. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Networks ![In: Networks 56(2), pp. 143-148, 2010. The full citation details ...](Pics/full.jpeg) |
2010 |
DBLP DOI BibTeX RDF |
|
15 | Eric Swartz |
A construction of an infinite family of 2-arc transitive polygonal graphs of arbitrary odd girth. ![Search on Bibsonomy](Pics/bibsonomy.png) |
J. Comb. Theory, Ser. A ![In: J. Comb. Theory, Ser. A 117(6), pp. 783-789, 2010. The full citation details ...](Pics/full.jpeg) |
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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
J. Comb. Theory, Ser. B ![In: J. Comb. Theory, Ser. B 100(6), pp. 554-559, 2010. The full citation details ...](Pics/full.jpeg) |
2010 |
DBLP DOI BibTeX RDF |
|
15 | Martin Kochol |
Smallest counterexample to the 5-flow conjecture has girth at least eleven. ![Search on Bibsonomy](Pics/bibsonomy.png) |
J. Comb. Theory, Ser. B ![In: J. Comb. Theory, Ser. B 100(4), pp. 381-389, 2010. The full citation details ...](Pics/full.jpeg) |
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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
J. Comb. Theory, Ser. B ![In: J. Comb. Theory, Ser. B 100(4), pp. 351-358, 2010. The full citation details ...](Pics/full.jpeg) |
2010 |
DBLP DOI BibTeX RDF |
|
15 | Flavio Chierichetti, Andrea Vattani |
The Local Nature of List Colorings for Graphs of High Girth. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SIAM J. Comput. ![In: SIAM J. Comput. 39(6), pp. 2232-2250, 2010. The full citation details ...](Pics/full.jpeg) |
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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ISIT ![In: IEEE International Symposium on Information Theory, ISIT 2010, June 13-18, 2010, Austin, Texas, USA, Proceedings, pp. 819-823, 2010, IEEE. The full citation details ...](Pics/full.jpeg) |
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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ICTC ![In: International Conference on Information and Communication Technology Convergence, ICTC 2010, Jeju, South Korea, 17-19 November 2010, pp. 175-176, 2010, IEEE. The full citation details ...](Pics/full.jpeg) |
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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ICTC ![In: International Conference on Information and Communication Technology Convergence, ICTC 2010, Jeju, South Korea, 17-19 November 2010, pp. 168-172, 2010, IEEE. The full citation details ...](Pics/full.jpeg) |
2010 |
DBLP DOI BibTeX RDF |
|
15 | Anna Adamaszek, Michal Adamaszek |
Large-Girth Roots of Graphs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
STACS ![In: 27th International Symposium on Theoretical Aspects of Computer Science, STACS 2010, March 4-6, 2010, Nancy, France, pp. 35-46, 2010, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-939897-16-3. The full citation details ...](Pics/full.jpeg) |
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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IIH-MSP ![In: Sixth International Conference on Intelligent Information Hiding and Multimedia Signal Processing (IIH-MSP 2010), Darmstadt, Germany, 15-17 October, 2010, Proceedings, pp. 470-473, 2010, IEEE Computer Society, 978-1-4244-8378-5. The full citation details ...](Pics/full.jpeg) |
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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
FSTTCS ![In: IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science, FSTTCS 2010, December 15-18, 2010, Chennai, India, pp. 96-107, 2010, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-939897-23-1. The full citation details ...](Pics/full.jpeg) |
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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Electron. Notes Discret. Math. ![In: Electron. Notes Discret. Math. 34, pp. 525-529, 2009. The full citation details ...](Pics/full.jpeg) |
2009 |
DBLP DOI BibTeX RDF |
|
15 | Charles Delorme, Evelyne Flandrin, Yuqing Lin, Mirka Miller, Joe Ryan 0001 |
On Extremal Graphs with Bounded Girth. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Electron. Notes Discret. Math. ![In: Electron. Notes Discret. Math. 34, pp. 653-657, 2009. The full citation details ...](Pics/full.jpeg) |
2009 |
DBLP DOI BibTeX RDF |
|
15 | Stephan Brandt, Elizabeth Ribe-Baumann |
Graphs of odd girth 7 with large degree. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Electron. Notes Discret. Math. ![In: Electron. Notes Discret. Math. 34, pp. 89-93, 2009. The full citation details ...](Pics/full.jpeg) |
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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Ind. Robot ![In: Ind. Robot 36(3), pp. 284-289, 2009. The full citation details ...](Pics/full.jpeg) |
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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Discuss. Math. Graph Theory ![In: Discuss. Math. Graph Theory 29(2), pp. 385-400, 2009. The full citation details ...](Pics/full.jpeg) |
2009 |
DBLP DOI BibTeX RDF |
|
15 | Camino Balbuena |
A method for obtaining small regular bipartite graphs of girth 8. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Discret. Math. Theor. Comput. Sci. ![In: Discret. Math. Theor. Comput. Sci. 11(2), pp. 33-46, 2009. The full citation details ...](Pics/full.jpeg) |
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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IEICE Trans. Fundam. Electron. Commun. Comput. Sci. ![In: IEICE Trans. Fundam. Electron. Commun. Comput. Sci. 92-A(11), pp. 2891-2894, 2009. The full citation details ...](Pics/full.jpeg) |
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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IEICE Trans. Commun. ![In: IEICE Trans. Commun. 92-B(1), pp. 306-309, 2009. The full citation details ...](Pics/full.jpeg) |
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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IEEE Signal Process. Lett. ![In: IEEE Signal Process. Lett. 16(6), pp. 521-524, 2009. The full citation details ...](Pics/full.jpeg) |
2009 |
DBLP DOI BibTeX RDF |
|
15 | Oleg V. Borodin, Anna O. Ivanova |
List 2-distance (Delta+2)-coloring of planar graphs with girth six. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Eur. J. Comb. ![In: Eur. J. Comb. 30(5), pp. 1257-1262, 2009. The full citation details ...](Pics/full.jpeg) |
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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Theor. Comput. Sci. ![In: Theor. Comput. Sci. 410(47-49), pp. 5196-5200, 2009. The full citation details ...](Pics/full.jpeg) |
2009 |
DBLP DOI BibTeX RDF |
|
15 | Zhangdong Ouyang, Jing Wang, Yuanqiu Huang |
Upper Embeddability, Girth and the Degree-Sum of Nonadjacent Vertices. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Graphs Comb. ![In: Graphs Comb. 25(2), pp. 253-264, 2009. The full citation details ...](Pics/full.jpeg) |
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 ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/0908.0697, 2009. The full citation details ...](Pics/full.jpeg) |
2009 |
DBLP BibTeX RDF |
|
15 | Anna Adamaszek, Michal Adamaszek |
Large-girth roots of graphs ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/0909.4011, 2009. The full citation details ...](Pics/full.jpeg) |
2009 |
DBLP BibTeX RDF |
|
15 | Christian Spagnol, Marta Rossi, Massimiliano Sala |
Quasi-cyclic LDPC codes with high girth ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/0906.3410, 2009. The full citation details ...](Pics/full.jpeg) |
2009 |
DBLP BibTeX RDF |
|
15 | Xueliang Li 0001, Jianxi Liu |
A proof of a conjecture on the Randic index of graphs with given girth. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Discret. Appl. Math. ![In: Discret. Appl. Math. 157(15), pp. 3332-3335, 2009. The full citation details ...](Pics/full.jpeg) |
2009 |
DBLP DOI BibTeX RDF |
|
15 | André Raspaud, Weifan Wang 0001 |
Linear coloring of planar graphs with large girth. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Discret. Math. ![In: Discret. Math. 309(18), pp. 5678-5686, 2009. The full citation details ...](Pics/full.jpeg) |
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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Discret. Math. ![In: Discret. Math. 309(23-24), pp. 6496-6502, 2009. The full citation details ...](Pics/full.jpeg) |
2009 |
DBLP DOI BibTeX RDF |
|
15 | Xiangwen Li |
On 3-choosable planar graphs of girth at least 4. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Discret. Math. ![In: Discret. Math. 309(8), pp. 2424-2431, 2009. The full citation details ...](Pics/full.jpeg) |
2009 |
DBLP DOI BibTeX RDF |
|
15 | Frédéric Havet |
Choosability of the square of planar subcubic graphs with large girth. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Discret. Math. ![In: Discret. Math. 309(11), pp. 3553-3563, 2009. The full citation details ...](Pics/full.jpeg) |
2009 |
DBLP DOI BibTeX RDF |
|
15 | Louis Esperet, Pascal Ochem |
On circle graphs with girth at least five. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Discret. Math. ![In: Discret. Math. 309(8), pp. 2217-2222, 2009. The full citation details ...](Pics/full.jpeg) |
2009 |
DBLP DOI BibTeX RDF |
|
15 | Alexandre Pinlou |
An oriented coloring of planar graphs with girth at least five. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Discret. Math. ![In: Discret. Math. 309(8), pp. 2108-2118, 2009. The full citation details ...](Pics/full.jpeg) |
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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Random Struct. Algorithms ![In: Random Struct. Algorithms 35(1), pp. 100-117, 2009. The full citation details ...](Pics/full.jpeg) |
2009 |
DBLP DOI BibTeX RDF |
|
15 | Klavdija Kutnar, Dragan Marusic |
A complete classification of cubic symmetric graphs of girth 6. ![Search on Bibsonomy](Pics/bibsonomy.png) |
J. Comb. Theory, Ser. B ![In: J. Comb. Theory, Ser. B 99(1), pp. 162-184, 2009. The full citation details ...](Pics/full.jpeg) |
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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
J. Comb. Theory, Ser. B ![In: J. Comb. Theory, Ser. B 99(4), pp. 674-684, 2009. The full citation details ...](Pics/full.jpeg) |
2009 |
DBLP DOI BibTeX RDF |
|
15 | Xueqin Jiang 0001, Moon Ho Lee |
Large girth quasi-cyclic LDPC codes based on the chinese remainder theorem. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IEEE Commun. Lett. ![In: IEEE Commun. Lett. 13(5), pp. 342-344, 2009. The full citation details ...](Pics/full.jpeg) |
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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
J. Graph Theory ![In: J. Graph Theory 62(4), pp. 346-361, 2009. The full citation details ...](Pics/full.jpeg) |
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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IEEE Trans. Veh. Technol. ![In: IEEE Trans. Veh. Technol. 57(2), pp. 1049-1060, 2008. The full citation details ...](Pics/full.jpeg) |
2008 |
DBLP DOI BibTeX RDF |
|
15 | Craig Timmons |
Star Coloring High Girth Planar Graphs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Electron. J. Comb. ![In: Electron. J. Comb. 15(1), 2008. The full citation details ...](Pics/full.jpeg) |
2008 |
DBLP BibTeX RDF |
|
15 | Qi Liu 0022, Douglas B. West |
Tree-Thickness and Caterpillar-Thickness under Girth Constraints. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Electron. J. Comb. ![In: Electron. J. Comb. 15(1), 2008. The full citation details ...](Pics/full.jpeg) |
2008 |
DBLP BibTeX RDF |
|
15 | Carlos Hoppen, Nicholas C. Wormald |
Induced Forests in Regular Graphs with Large Girth. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Comb. Probab. Comput. ![In: Comb. Probab. Comput. 17(3), pp. 389-410, 2008. The full citation details ...](Pics/full.jpeg) |
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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SIAM J. Discret. Math. ![In: SIAM J. Discret. Math. 22(4), pp. 1351-1363, 2008. The full citation details ...](Pics/full.jpeg) |
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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SIAM J. Discret. Math. ![In: SIAM J. Discret. Math. 22(2), pp. 568-591, 2008. The full citation details ...](Pics/full.jpeg) |
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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Eur. J. Comb. ![In: Eur. J. Comb. 29(5), pp. 1235-1241, 2008. The full citation details ...](Pics/full.jpeg) |
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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Eur. J. Comb. ![In: Eur. J. Comb. 29(4), pp. 838-849, 2008. The full citation details ...](Pics/full.jpeg) |
2008 |
DBLP DOI BibTeX RDF |
|
15 | Michael A. Henning, Anders Yeo |
Total Domination in Graphs with Given Girth. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Graphs Comb. ![In: Graphs Comb. 24(4), pp. 333-348, 2008. The full citation details ...](Pics/full.jpeg) |
2008 |
DBLP DOI BibTeX RDF |
|
15 | Christian Löwenstein, Dieter Rautenbach |
Domination in Graphs of Minimum Degree at least Two and Large Girth. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Graphs Comb. ![In: Graphs Comb. 24(1), pp. 37-46, 2008. The full citation details ...](Pics/full.jpeg) |
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 ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/0807.1277, 2008. The full citation details ...](Pics/full.jpeg) |
2008 |
DBLP BibTeX RDF |
|
15 | Mohsen Bayati, Andrea Montanari, Amin Saberi |
Generating Random Graphs with Large Girth ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/0811.2853, 2008. The full citation details ...](Pics/full.jpeg) |
2008 |
DBLP BibTeX RDF |
|
15 | |
On Mean Distance and Girth ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/0806.1438, 2008. The full citation details ...](Pics/full.jpeg) |
2008 |
DBLP BibTeX RDF |
|
15 | Mostafa Esmaeili, Mehdi Gholami |
Maximum-girth slope-based quasi-cyclic (2, k ≥ 5) low-density parity-check codes. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IET Commun. ![In: IET Commun. 2(10), pp. 1251-1262, 2008. The full citation details ...](Pics/full.jpeg) |
2008 |
DBLP DOI BibTeX RDF |
|
15 | Moo Young Sohn, Xudong Yuan |
i?(1)-perfect graphs with girth at least six. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Ars Comb. ![In: Ars Comb. 87, 2008. The full citation details ...](Pics/full.jpeg) |
2008 |
DBLP BibTeX RDF |
|
15 | Simon Marshall |
Another Simple Proof of the High Girth, High Chromatic Number Theorem. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Am. Math. Mon. ![In: Am. Math. Mon. 115(1), pp. 68-70, 2008. The full citation details ...](Pics/full.jpeg) |
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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Discret. Math. ![In: Discret. Math. 308(16), pp. 3526-3536, 2008. The full citation details ...](Pics/full.jpeg) |
2008 |
DBLP DOI BibTeX RDF |
|