On Stable Cutsets in Line Graphs
WG '01 Proceedings of the 27th International Workshop on Graph-Theoretic Concepts in Computer Science
On stable cutsets in line graphs
Theoretical Computer Science
Discrete Applied Mathematics
The sandwich problem for cutsets: clique cutset, k-star cutset
Discrete Applied Mathematics - Special issue: Traces of the Latin American conference on combinatorics, graphs and applications: a selection of papers from LACGA 2004, Santiago, Chile
On stable cutsets in claw-free graphs and planar graphs
Journal of Discrete Algorithms
Note: Matching cutsets in graphs of diameter 2
Theoretical Computer Science
Parameterizing Cut Sets in a Graph by the Number of Their Components
ISAAC '09 Proceedings of the 20th International Symposium on Algorithms and Computation
The polynomial dichotomy for three nonempty part sandwich problems
Discrete Applied Mathematics
Parameterizing cut sets in a graph by the number of their components
Theoretical Computer Science
The computational complexity of disconnected cut and 2K2-partition
CP'11 Proceedings of the 17th international conference on Principles and practice of constraint programming
On stable cutsets in claw-free graphs and planar graphs
WG'05 Proceedings of the 31st international conference on Graph-Theoretic Concepts in Computer Science
The P versus NP-complete dichotomy of some challenging problems in graph theory
Discrete Applied Mathematics
| Hi-index | 0.05 |