Items where Subject is "05-XX Combinatorics > 05Cxx Graph theory > 05C83 Graph minors"

Up a level
Export as [feed] Atom [feed] RSS 1.0 [feed] RSS 2.0
Group by: Authors | Item Type
Jump to: G | K | W
Number of items at this level: 3.

G

Gassner, Elisabeth and Percan, Merijam (2006) On the Weighted Minimal Deletion of Rooted Bipartite Minors.
Technical Report , 35 p.

K

Korach, Ephraim and Nguyen, Thành and Peis, Britta (2006) Subgraph characterization of Red/Blue-split graphs and König-Egerváry graphs.
Published In: SODA : Proceedings of the Seventeenth Annual ACM-SIAM Symposium on Discrete Algorithms ; Miami, FL., January 22 - 24, 2006 ACM 2006, pp. 842-850.

W

Weil, Vera and Schaudt, Oliver (2015) On bounding the difference of the maximum degree and clique number.
Published in: Graphs and Combinatorics Vol. 31 (5). pp. 1689-1702. ISSN 0911-0119

This list was generated on Mon Oct 23 09:40:31 2017 CEST.