Showing results 1 to 20 of 74
next >
| Title | Author(s) | Issue Date | |
|---|---|---|---|
A 2-approximation algorithm for path coloring on a restricted class of trees of rings Journal:Journal of Algorithms | 2003 | ||
A Polyhedral Description of Kernels Proceeding/Conference:SIAM Conference on Discrete Mathematics | 2016 | ||
A Polyhedral Description of Kernels Journal:Mathematics of Operations Research | 2016 | ||
A Unified Approach to Box-Mengerian Hypergraphs Proceeding/Conference:2009 International and 5th Cross-strait Conference on Graph Theory and Combinatorics | 2009 | ||
| 2010 | |||
Acyclic digraphs with the Gallai-Milgram-Linial property for clique-covers Journal:Discrete Mathematics | 1999 | ||
An Optimal Binding Number Condition for Bipancyclism Journal:SIAM Journal on Discrete Mathematics | 2013 | ||
Approximate min-max relations on plane graphs Journal:Journal of Combinatorial Optimization | 2013 | ||
Approximating the chromatic index of multigraphs Journal:Journal of Combinatorial Optimization | 2011 | ||
Approximating the longest cycle problem on graphs with bounded degree Proceeding/Conference:Lecture Notes in Computer Science | 2005 | ||
An approximation algorithm for feedback vertex sets in tournaments Journal:SIAM Journal on Computing | 2001 | ||
Asymptotic upper bounds for ramsey functions Journal:Graphs and Combinatorics | 2001 | ||
Bonds with parity constraints Journal:Journal of Combinatorial Theory. Series B | 2012 | ||
The box-TDI system associated with 2-edge connected spanning subgraphs Journal:Discrete Applied Mathematics | 2009 | ||
A characterization of almost CIS graphs Journal:SIAM Journal on Discrete Mathematics | 2009 | ||
A characterization of box-mengerian matroid ports Journal:Mathematics of Operations Research | 2008 | ||
The circumference of a graph with no K3, t-minor Journal:Journal of Combinatorial Theory. Series B | 2006 | ||
The circumference of a graph with no K3,t-minor, II Journal:Journal of Combinatorial Theory Series B | 2012 | ||
Coloring digraphs with forbidden cycles Journal:Journal of Combinatorial Theory, Series B | 2015 | ||
Coloring graphs with no odd-K4 Journal:Discrete Mathematics | 1998 |