The FacetedDBLP logo    Search for: in:

Disable automatic phrases ?     Syntactic query expansion: ?

Searching for 05C70 with no syntactic query expansion in all metadata.

Publication years (Num. hits)
1998-2001 (16) 2002-2005 (17) 2006-2009 (14)
Publication types (Num. hits)
article(45) inproceedings(2)
Venues (Conferences, Journals, ...)
GrowBag graphs for keyword ? (Num. hits/coverage)

Group by:
The graphs summarize 68 occurrences of 27 keywords

Results
Found 47 publication records. Showing 47 according to the selection in the facets
Hits ? Authors Title Venue Year Link Author keywords
19Gyula Pap Weighted restricted 2-matching. Search on Bibsonomy Math. Program. The full citation details ... 2009 DBLP  DOI  BibTeX  RDF Mathematics Subject Classification (2000) 05C70, 90C27
19Pierre Charbit, András Sebö Cyclic orders: Equivalence and duality. Search on Bibsonomy Comb. The full citation details ... 2008 DBLP  DOI  BibTeX  RDF Mathematics Subject Classification (2000) 05C38, 90C27, 90C10, 05C70, 05C20
19Hemanshu Kaul, Alexandr V. Kostochka, Gexin Yu On a graph packing conjecture by Bollobás, Eldridge and Catlin. Search on Bibsonomy Comb. The full citation details ... 2008 DBLP  DOI  BibTeX  RDF Mathematics Subject Classification (2000) 05C35, 05C70
19Serguei Norine, Robin Thomas 0001 Pfaffian labelings and signs of edge colorings. Search on Bibsonomy Comb. The full citation details ... 2008 DBLP  DOI  BibTeX  RDF Mathematics Subject Classification (2000) 05C70, 05C15, 05C75, 05C10
19Serguei Norine Pfaffian graphs, T -joins and crossing numbers. Search on Bibsonomy Comb. The full citation details ... 2008 DBLP  DOI  BibTeX  RDF Mathematics Subject Classification (2000) 05C70, 05C75, 05C10
19Gerzson Kéri The covering radius of extreme binary 2-surjective codes. Search on Bibsonomy Des. Codes Cryptogr. The full citation details ... 2008 DBLP  DOI  BibTeX  RDF AMS Classifications 94B75, 05C70, 05C65, 94B25
19Kenjiro Takazawa A weighted even factor algorithm. Search on Bibsonomy Math. Program. The full citation details ... 2008 DBLP  DOI  BibTeX  RDF Mathematics Subject Classification (2000) 90C27, 05C70
19Gyula Pap Packing Non-Returning A-Paths. Search on Bibsonomy Comb. The full citation details ... 2007 DBLP  DOI  BibTeX  RDF Mathematics Subject Classification (2000): 05C70, 05C40
19Lap Chi Lau An Approximate Max-Steiner-Tree-Packing Min-Steiner-Cut Theorem*. Search on Bibsonomy Comb. The full citation details ... 2007 DBLP  DOI  BibTeX  RDF Mathematics Subject Classification (2000): 05C05, 68R10, 05C70, 68W25, 05C40
19Hong-Jian Lai, Rui Xu 0023, Cun-Quan Zhang On Circular Flows Of Graphs. Search on Bibsonomy Comb. The full citation details ... 2007 DBLP  DOI  BibTeX  RDF Mathematics Subject Classification (2000): 05C40, 05C70, 05C15
19Ian M. Wanless Addendum To Schrijver's Work On Minimum Permanents. Search on Bibsonomy Comb. The full citation details ... 2006 DBLP  DOI  BibTeX  RDF Mathematics Subject Classification (2000): 15A15, 05C70, 05C80, 05C50
19Stephan Brandt, Hajo Broersma, Reinhard Diestel, Matthias Kriesell Global Connectivity And Expansion: Long Cycles and Factors In f-Connected Graphs. Search on Bibsonomy Comb. The full citation details ... 2006 DBLP  DOI  BibTeX  RDF Mathematics Subject Classification (2000): 05C40, 05C45, 05C70, 05C38
19Balázs Szegedy, Christian Szegedy Symplectic Spaces And Ear-Decomposition Of Matroids. Search on Bibsonomy Comb. The full citation details ... 2006 DBLP  DOI  BibTeX  RDF Mathematics Subject Classification (2000): 05C70, 05C85, 05C50
19Jianguo Qian Induced Matching Extendable Graph Powers. Search on Bibsonomy Graphs Comb. The full citation details ... 2006 DBLP  DOI  BibTeX  RDF AMS Subject Classifications 05C70 (05C35)
19Nathan Linial, Eyal Rozenman Random Lifts Of Graphs: Perfekt Matchings. Search on Bibsonomy Comb. The full citation details ... 2005 DBLP  DOI  BibTeX  RDF Mathematics Subject Classification (2000): 05C80, 05C70
19James F. Geelen, Satoru Iwata 0001 Matroid Matching Via Mixed Skew-Symmetric Matrices. Search on Bibsonomy Comb. The full citation details ... 2005 DBLP  DOI  BibTeX  RDF Mathematics Subject Classification (2000): 05C70
19Arne Hoffmann, Lutz Volkmann Structural Remarks on Bipartite Graphs with Unique f-Factors. Search on Bibsonomy Graphs Comb. The full citation details ... 2005 DBLP  DOI  BibTeX  RDF Mathematics Subject Classificiation Primary 05C70, Secondary 05C35
19Mikio Kano, Haruhide Matsuda A Neighborhood Condition for Graphs to Have [ a , b ]-Factors III. Search on Bibsonomy CJCDGCGT The full citation details ... 2005 DBLP  DOI  BibTeX  RDF AMS Subject Classifications 05C70
19Yinghong Ma, Qinglin Yu Isolated Toughness and Existence of f -Factors. Search on Bibsonomy CJCDGCGT The full citation details ... 2005 DBLP  DOI  BibTeX  RDF AMS Subject Classifications 05C70
19Gábor N. Sárközy, Stanley M. Selkow An Extension Of The Ruzsa-Szemerédi Theorem. Search on Bibsonomy Comb. The full citation details ... 2004 DBLP  DOI  BibTeX  RDF Mathematics Subject Classification (2000): 05C65, 05C70
19Rong Luo, Wenan Zang, Cun-Quan Zhang Nowhere-Zero 4-Flows, Simultaneous Edge-Colorings, And Critical Partial Latin Squares. Search on Bibsonomy Comb. The full citation details ... 2004 DBLP  DOI  BibTeX  RDF Mathematics Subject Classification (2000): 05C15, 05C07, 05C70, 05C38, 05B15
19Michael Krivelevich, Benny Sudakov, Tibor Szabó Triangle Factors In Sparse Pseudo-Random Graphs. Search on Bibsonomy Comb. The full citation details ... 2004 DBLP  DOI  BibTeX  RDF Mathematics Subject Classification (2000): 05C70, 05C80
19Lutz Volkmann The Maximum Size Of Graphs With A Unique k- Factor. Search on Bibsonomy Comb. The full citation details ... 2004 DBLP  DOI  BibTeX  RDF Mathematics Subject Classification (2000): 05C70
19Bodo Lass Matching Polynomials And Duality. Search on Bibsonomy Comb. The full citation details ... 2004 DBLP  DOI  BibTeX  RDF Mathematics Subject Classification (2000): 05C70, 05A20, 05E35, 12D10, 05A15
19Jørgen Bang-Jensen, Anders Yeo Decomposing k-arc-Strong Tournaments Into Strong Spanning Subdigraphs. Search on Bibsonomy Comb. The full citation details ... 2004 DBLP  DOI  BibTeX  RDF Mathematics Subject Classification (2000): 05C20, 05C70, 05C38, 05C40
19Béla Csaba, Ali Shokoufandeh, Endre Szemerédi Proof of a Conjecture of Bollobás and Eldridge for Graphs of Maximum Degree Three. Search on Bibsonomy Comb. The full citation details ... 2003 DBLP  DOI  BibTeX  RDF AMS Subject Classification (2000): 05C35, 05C70
19Zoltán Szigeti Perfect Matchings Versus Odd Cuts. Search on Bibsonomy Comb. The full citation details ... 2002 DBLP  DOI  BibTeX  RDF AMS Subject Classification (2000): 05C70
19Anna Galluccio, Luis A. Goddyn The Circular Flow Number of a 6-Edge Connected Graph is Less Than Four. Search on Bibsonomy Comb. The full citation details ... 2002 DBLP  DOI  BibTeX  RDF AMS Subject Classification (2000) Classes: 05C70, 90C35, 90B10
19Andreas Huck, Eberhard Triesch Perfect Matchings in Balanced Hypergraphs - A Combinatorial Approach. Search on Bibsonomy Comb. The full citation details ... 2002 DBLP  DOI  BibTeX  RDF AMS Subject Classification (2000) Classes: 05C65, 05C70
19Ron Aharoni, Eli Berger, Ran Ziv A Tree Version of Konig's Theorem. Search on Bibsonomy Comb. The full citation details ... 2002 DBLP  DOI  BibTeX  RDF AMS Subject Classification (2000) Classes: 05C70
19Mekkia Kouider, Maryvonne Mahéo Connected [a, b]-factors in Graphs. Search on Bibsonomy Comb. The full citation details ... 2002 DBLP  DOI  BibTeX  RDF AMS Subject Classification (2000) Classes: 05C70
19Penny E. Haxell, Vojtech Rödl Integer and Fractional Packings in Dense Graphs. Search on Bibsonomy Comb. The full citation details ... 2001 DBLP  DOI  BibTeX  RDF AMS Subject Classification (2000) Classes: 05C70, 05C85
19Odile Marcotte Optimal Edge-Colourings for a Class of Planar Multigraphs. Search on Bibsonomy Comb. The full citation details ... 2001 DBLP  DOI  BibTeX  RDF AMS Subject Classification (2000) Classes: 05C15, 90C10, 05C70
19Dieter Rautenbach, Bruce A. Reed The Erdos-Pósa Property for Odd Cycles in Highly Connected Graphs. Search on Bibsonomy Comb. The full citation details ... 2001 DBLP  DOI  BibTeX  RDF AMS Subject Classification (2000) Classes: 05C40, 05C70, 05C99
19Venkatesan Guruswami, C. Pandu Rangan, Maw-Shang Chang, Gerard J. Chang, C. K. Wong The Kr-Packing Problem. Search on Bibsonomy Computing The full citation details ... 2001 DBLP  DOI  BibTeX  RDF AMS Subject Classifications: 05C70, 68Q20, 05C85
19Raphael Yuster Decomposing Hypergraphs into Simple Hypertrees. Search on Bibsonomy Comb. The full citation details ... 2000 DBLP  DOI  BibTeX  RDF AMS Subject Classification (1991) Classes: 05C65, 05C70
19Jeff Kahn 0001 A Normal Law for Matchings. Search on Bibsonomy Comb. The full citation details ... 2000 DBLP  DOI  BibTeX  RDF AMS Subject Classification (1991) Classes: 05C70, 05C65, 05B35, 60F05
19Alexander Schrijver Total Dual Integrality of Matching Forest Constraints. Search on Bibsonomy Comb. The full citation details ... 2000 DBLP  DOI  BibTeX  RDF AMS Subject Classification (1991) Classes: 05C70, 90C27, 90C57
19Mekkia Kouider Neighborhoods and Covering Vertices by Cycles. Search on Bibsonomy Comb. The full citation details ... 2000 DBLP  DOI  BibTeX  RDF AMS Subject Classification (1991) Classes: 05C38, 05C35, 05C70
19Kathie Cameron A Min-Max Relation for Monotone Path Systems in Simple Regions. Search on Bibsonomy Comb. The full citation details ... 2000 DBLP  DOI  BibTeX  RDF AMS Subject Classification (1991) Classes: 52A37, 05C85, 05C70, 05C38
19James F. Geelen An Algebraic Matching Algorithm. Search on Bibsonomy Comb. The full citation details ... 2000 DBLP  DOI  BibTeX  RDF AMS Subject Classification (1991) Classes: 05C70
19David A. Grable More-Than-Nearly-Perfect Packings and Partial Designs. Search on Bibsonomy Comb. The full citation details ... 1999 DBLP  DOI  BibTeX  RDF AMS Subject Classification (1991) Classes: 05C70, 05B05
19Marcelo Henriques de Carvalho, Cláudio Leonardo Lucchesi, Uppaluri S. R. Murty Ear Decompositions of Matching Covered Graphs. Search on Bibsonomy Comb. The full citation details ... 1999 DBLP  DOI  BibTeX  RDF AMS Subject Classification (1991) Classes: 05C70
19Mariusz Meszka, Zdzislaw Skupien Self-Converse and Oriented Graphs among the Third Parts of Nearly Complete Digraphs. Search on Bibsonomy Comb. The full citation details ... 1998 DBLP  DOI  BibTeX  RDF AMS Subject Classification (1991) Classes: 05C70, 05C20
19Jeff Kahn 0001, Jeong Han Kim Random Matchings in Regular Graphs. Search on Bibsonomy Comb. The full citation details ... 1998 DBLP  DOI  BibTeX  RDF AMS Subject Classification (1991) Classes: 05C65, 60G42, 05C70, 05C80, 60C05, 60F05
19Hikoe Enomoto On the Existence of Disjoint Cycles in a Graph. Search on Bibsonomy Comb. The full citation details ... 1998 DBLP  DOI  BibTeX  RDF AMS Subject Classification (1991) Classes: 05C38, 05C70
19Hong Wang 0005 Vertex-Disjoint Triangles in Claw-Free Graphs with Minimum Degree at Least Three. Search on Bibsonomy Comb. The full citation details ... 1998 DBLP  DOI  BibTeX  RDF AMS Subject Classification (1991) Classes: 05C35, 05C70
Displaying result #1 - #47 of 47 (100 per page; Change: )
Valid XHTML 1.1! Valid CSS! [Valid RSS]
Maintained by L3S.
Previously maintained by Jörg Diederich.
Based upon DBLP by Michael Ley.
open data data released under the ODC-BY 1.0 license