|
|
Venues (Conferences, Journals, ...)
|
|
GrowBag graphs for keyword ? (Num. hits/coverage)
Group by:
The graphs summarize 46 occurrences of 20 keywords
|
|
|
Results
Found 22 publication records. Showing 22 according to the selection in the facets
Hits ?▲ |
Authors |
Title |
Venue |
Year |
Link |
Author keywords |
55 | András Frank, László Szegö |
An Extension of a Theorem of Henneberg and Laman. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IPCO ![In: Integer Programming and Combinatorial Optimization, 8th International IPCO Conference, Utrecht, The Netherlands, June 13-15, 2001, Proceedings, pp. 145-159, 2001, Springer, 3-540-42225-0. The full citation details ...](Pics/full.jpeg) |
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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
J. Intell. Robotic Syst. ![In: J. Intell. Robotic Syst. 56(1-2), pp. 99-126, 2009. The full citation details ...](Pics/full.jpeg) |
2009 |
DBLP DOI BibTeX RDF |
Mathematics Subject Classifications (2000) 93C85, 05C40, 05C50, 68W15 |
22 | Gyula Pap |
Packing Non-Returning A-Paths. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Comb. ![In: Comb. 27(2), pp. 247-251, 2007. The full citation details ...](Pics/full.jpeg) |
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*. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Comb. ![In: Comb. 27(1), pp. 71-90, 2007. The full citation details ...](Pics/full.jpeg) |
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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Comb. ![In: Comb. 27(2), pp. 245-246, 2007. The full citation details ...](Pics/full.jpeg) |
2007 |
DBLP DOI BibTeX RDF |
Mathematics Subject Classification (2000): 05C40, 05C70, 05C15 |
22 | Mikkel Thorup |
Fully-Dynamic Min-Cut. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Comb. ![In: Comb. 27(1), pp. 91-127, 2007. The full citation details ...](Pics/full.jpeg) |
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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Math. Program. ![In: Math. Program. 110(1), pp. 111-144, 2007. The full citation details ...](Pics/full.jpeg) |
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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Comb. ![In: Comb. 26(1), pp. 17-36, 2006. The full citation details ...](Pics/full.jpeg) |
2006 |
DBLP DOI BibTeX RDF |
Mathematics Subject Classification (2000): 05C40, 05C45, 05C70, 05C38 |
22 | Matthias Kriesell |
Mader's Conjecture On Extremely Critical Graphs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Comb. ![In: Comb. 26(3), pp. 277-314, 2006. The full citation details ...](Pics/full.jpeg) |
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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Comb. ![In: Comb. 26(3), pp. 255-275, 2006. The full citation details ...](Pics/full.jpeg) |
2006 |
DBLP DOI BibTeX RDF |
Mathematics Subject Classification (2000): 68W25, 90C27, 68R10, 90C35, 05C40, 90B10 |
22 | Matthias Kriesell |
Closed Separator Sets. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Comb. ![In: Comb. 25(5), pp. 575-598, 2005. The full citation details ...](Pics/full.jpeg) |
2005 |
DBLP DOI BibTeX RDF |
Mathematics Subject Classification (2000): 05C40 |
22 | Ou Jianping, Fuji Zhang |
Super Restricted Edge Connectivity of Regular Graphs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Graphs Comb. ![In: Graphs Comb. 21(4), pp. 459-467, 2005. The full citation details ...](Pics/full.jpeg) |
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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Graphs Comb. ![In: Graphs Comb. 21(1), pp. 27-37, 2005. The full citation details ...](Pics/full.jpeg) |
2005 |
DBLP DOI BibTeX RDF |
AMS Subject Classification, 05C40 |
22 | Wolfgang Mader 0001 |
High Connectivity Keeping Sets In n-Connected Graphs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Comb. ![In: Comb. 24(3), pp. 441-458, 2004. The full citation details ...](Pics/full.jpeg) |
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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Comb. ![In: Comb. 24(3), pp. 331-349, 2004. The full citation details ...](Pics/full.jpeg) |
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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Comput. Complex. ![In: Comput. Complex. 12(3-4), pp. 131-149, 2003. The full citation details ...](Pics/full.jpeg) |
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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Comb. ![In: Comb. 23(2), pp. 185-203, 2003. The full citation details ...](Pics/full.jpeg) |
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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Comb. ![In: Comb. 22(1), pp. 47-70, 2002. The full citation details ...](Pics/full.jpeg) |
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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Comb. ![In: Comb. 22(4), pp. 537-554, 2002. The full citation details ...](Pics/full.jpeg) |
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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Comb. ![In: Comb. 22(1), pp. 1-18, 2002. The full citation details ...](Pics/full.jpeg) |
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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Comb. ![In: Comb. 21(2), pp. 267-278, 2001. The full citation details ...](Pics/full.jpeg) |
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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Comb. ![In: Comb. 21(2), pp. 321-333, 2001. The full citation details ...](Pics/full.jpeg) |
2001 |
DBLP DOI BibTeX RDF |
AMS Subject Classification (2000) Classes: 05C38, 05C40 |
Displaying result #1 - #22 of 22 (100 per page; Change: )
|
|