Search results for "05C38"

Hits ?▲	Authors	Title	Venue	Year	Link	Author keywords
21	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
21	Benny Sudakov, Jacques Verstraëte	Cycle lengths in sparse graphs.	Comb.	2008	DBLP DOI BibTeX RDF	Mathematics Subject Classification (2000) 05C35, 05C38
21	András Gyárfás, Miklós Ruszinkó, Gábor N. Sárközy, Endre Szemerédi	Three-color Ramsey numbers for paths.	Comb.	2008	DBLP DOI BibTeX RDF	Mathematics Subject Classification (2000) 05C55, 05C38
21	Maria Chudnovsky, Paul D. Seymour, Blair D. Sullivan	Cycles in dense digraphs.	Comb.	2008	DBLP DOI BibTeX RDF	Mathematics Subject Classification (2000) 05C20, 05C35, 05C38
21	Etienne Birmelé, J. Adrian Bondy, Bruce A. Reed	The Erdös-Pósa Property For Long Circuits.	Comb.	2007	DBLP DOI BibTeX RDF	Mathematics Subject Classification (2000): 05C35, 05C83, 05C38
21	András Gyárfás, Miklós Ruszinkó, Gábor N. Sárközy, Endre Szemerédi	Three-Color Ramsey Numbers For Paths.	Comb.	2007	DBLP DOI BibTeX RDF	Mathematics Subject Classification (2000): 05C55, 05C38
21	Irène Charon, Olivier Hudry	A survey on the linear ordering problem for weighted or unweighted tournaments.	4OR	2007	DBLP DOI BibTeX RDF	Mathematical Subject Classification (2000) 05C20, 05C90, 06A05, 91F10, 90C27, 68Q17, 68Q25, 90C57, 68R10, 90C10, 90C59, 90C35, 05C38, 06A07
21	Samuel Fiorini, Nadia Hardy, Bruce A. Reed, Adrian Vetta	Approximate min-max relations for odd cycles in planar graphs.	Math. Program.	2007	DBLP DOI BibTeX RDF	Mathematics Subject Classification (2000) 05C38, 90C27, 05C85, 68W25
21	Seth Pettie	An Inverse-Ackermann Type Lower Bound For Online Minimum Spanning Tree Verification.	Comb.	2006	DBLP DOI BibTeX RDF	Mathematics Subject Classification (2000): 05C38, 68W01, 68R10
21	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
21	Dirk Müller 0003	On the complexity of the planar directed edge-disjoint paths problem.	Math. Program.	2006	DBLP DOI BibTeX RDF	Mathematics Subject Classification (2000) 05C38, 68Q17, 68R10, 90C35
21	Sean McGuinness	Bonds Intersecting Cycles In A Graph.	Comb.	2005	DBLP DOI BibTeX RDF	Mathematics Subject Classification (2000): 05C38, 05C35
21	Sean McGuinness	Circuits Through Cocircuits In A Graph With Extensions To Matroids.	Comb.	2005	DBLP DOI BibTeX RDF	Mathematics Subject Classification (2000): 05C38, 05B35
21	Evelyne Flandrin, Hao Li 0002, Antoni Marczyk, Mariusz Wozniak	A Note on a Generalisation of Ore's Condition.	Graphs Comb.	2005	DBLP DOI BibTeX RDF	1991 Mathematics Subject Classification: 05C38, 05C45
21	Jacques Verstraëte	On The Number Of Sets Of Cycle Lengths.	Comb.	2004	DBLP DOI BibTeX RDF	Mathematics Subject Classification (2000): 05C38
21	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
21	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
21	Andreas Bley	On the complexity of vertex-disjoint length-restricted path problems.	Comput. Complex.	2003	DBLP DOI BibTeX RDF	Mathematics Subject Classification (2000). 68Q25, 90C27, 05C38, 05C40
21	Guantao Chen, Ronald J. Gould, Xingxing Yu	Graph Connectivity After Path Removal.	Comb.	2003	DBLP DOI BibTeX RDF	AMS Subject Classification (2000): 05C40, 05C38
21	Ya-Chen Chen, Zoltán Füredi	Hamiltonian Kneser Graphs.	Comb.	2002	DBLP DOI BibTeX RDF	AMS Subject Classification (2000) Classes: 05C45, 05C38
21	Carsten Thomassen	The Erdos-Pósa Property for Odd Cycles in Graphs of Large Connectivity.	Comb.	2001	DBLP DOI BibTeX RDF	AMS Subject Classification (2000) Classes: 05C38, 05C40
21	Mekkia Kouider	Neighborhoods and Covering Vertices by Cycles.	Comb.	2000	DBLP DOI BibTeX RDF	AMS Subject Classification (1991) Classes: 05C38, 05C35, 05C70
21	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
21	Sabine Le Borne	Ordering Techniques for Two- and Three-Dimensional Convection-Dominated Elliptic Boundary Value Problems.	Computing	2000	DBLP DOI BibTeX RDF	AMS Subject Classifications: 05C20, 65N55, 05C85, 05C38
21	Yefim Dinitz, Naveen Garg 0001, Michel X. Goemans	On the Single-Source Unsplittable Flow Problem.	Comb.	1999	DBLP DOI BibTeX RDF	AMS Subject Classification (1991) Classes: 90B10, 05C85, 90C35, 05C38
21	Gerald W. Schuster	A Minimum Degree Result for Disjoint Cycles and Forests in Graphs.	Comb.	1998	DBLP DOI BibTeX RDF	AMS Subject Classification (1991) Classes: 05C05, 05C35, 05C38
21	Yoshiharu Kohayakawa, Bernd Kreuter, Angelika Steger	An Extremal Problem For Random Graphs And The Number Of Graphs With Large Even-Girth.	Comb.	1998	DBLP DOI BibTeX RDF	AMS Subject Classification (1991) Classes: 05A16, 05C35, 05C38, 05C80
21	Hikoe Enomoto	On the Existence of Disjoint Cycles in a Graph.	Comb.	1998	DBLP DOI BibTeX RDF	AMS Subject Classification (1991) Classes: 05C38, 05C70