Search results for "05C40"

Hits ?▲	Authors	Title	Venue	Year	Link	Author keywords
55	András Frank, László Szegö	An Extension of a Theorem of Henneberg and Laman.	IPCO	2001	DBLP DOI BibTeX RDF	constructive characterization, packing and covering by trees AMS subject classification. 05C40, graph, rigidity
22	Michael Schuresko, Jorge Cortés 0001	Distributed Motion Constraints for Algebraic Connectivity of Robotic Networks.	J. Intell. Robotic Syst.	2009	DBLP DOI BibTeX RDF	Mathematics Subject Classifications (2000) 93C85, 05C40, 05C50, 68W15
22	Gyula Pap	Packing Non-Returning A-Paths.	Comb.	2007	DBLP DOI BibTeX RDF	Mathematics Subject Classification (2000): 05C70, 05C40
22	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
22	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
22	Mikkel Thorup	Fully-Dynamic Min-Cut.	Comb.	2007	DBLP DOI BibTeX RDF	Mathematics Subject Classification (2000): 68Q25, 68W05, 94C12, 94C15, 90B25, 68R10, 05C85, 05C40, 90B10
22	Harold N. Gabow	On the Linfinity-norm of extreme points for crossing supermodular directed network LPs.	Math. Program.	2007	DBLP DOI BibTeX RDF	Mathematics Subject Classification (2000) 68W25, 68R10, 90C05, 05C40, 90B10, 05C20
22	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
22	Matthias Kriesell	Mader's Conjecture On Extremely Critical Graphs.	Comb.	2006	DBLP DOI BibTeX RDF	Mathematics Subject Classification (2000): 05C40, 05C35, 05C75
22	Joseph Cheriyan, Santosh S. Vempala, Adrian Vetta	Network Design Via Iterative Rounding Of Setpair Relaxations.	Comb.	2006	DBLP DOI BibTeX RDF	Mathematics Subject Classification (2000): 68W25, 90C27, 68R10, 90C35, 05C40, 90B10
22	Matthias Kriesell	Closed Separator Sets.	Comb.	2005	DBLP DOI BibTeX RDF	Mathematics Subject Classification (2000): 05C40
22	Ou Jianping, Fuji Zhang	Super Restricted Edge Connectivity of Regular Graphs.	Graphs Comb.	2005	DBLP DOI BibTeX RDF	AMS Classification 05C40
22	Kiyoshi Ando, Atsushi Kaneko, Ken-ichi Kawarabayashi	Vertices of Degree 5 in a Contraction Critically 5-connected Graph.	Graphs Comb.	2005	DBLP DOI BibTeX RDF	AMS Subject Classification, 05C40
22	Wolfgang Mader 0001	High Connectivity Keeping Sets In n-Connected Graphs.	Comb.	2004	DBLP DOI BibTeX RDF	Mathematics Subject Classification (2000): 05C40, 05C35
22	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
22	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
22	Guantao Chen, Ronald J. Gould, Xingxing Yu	Graph Connectivity After Path Removal.	Comb.	2003	DBLP DOI BibTeX RDF	AMS Subject Classification (2000): 05C40, 05C38
22	András Frank, Zoltán Király	Graph Orientations with Edge-connection and Parity Constraints.	Comb.	2002	DBLP DOI BibTeX RDF	AMS Subject Classification (2000) Classes: 05C75, 05C40
22	Hiroshi Nagamochi, Tibor Jordán, Yoshitaka Nakao, Toshihide Ibaraki	Convex Embeddings and Bisections of 3-Connected Graphs 1.	Comb.	2002	DBLP DOI BibTeX RDF	AMS Subject Classification (2000): 05C40, 05C35
22	Alon Amit, Nathan Linial	Random Graph Coverings I: General Theory and Graph Connectivity.	Comb.	2002	DBLP DOI BibTeX RDF	AMS Subject Classification (2000) Classes: 05C80, 05C40, 05C10
22	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
22	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