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