A Mickey-Mouse Decomposition Theorem

Authors:
Michele Conforti;Gérard Cornuéjols;Ajai Kapoor;Kristina Vuskovic
Affiliations:
-;-;-;-
Venue:
Proceedings of the 4th International IPCO Conference on Integer Programming and Combinatorial Optimization
Year:
1995

Citing 0
Cited 5

Graphs without odd holes, parachutes or proper wheels: a generalization of Meyniel graphs and of line graphs of bipartite graphs

Journal of Combinatorial Theory Series B
Square-free perfect graphs

Journal of Combinatorial Theory Series B
Decomposition of odd-hole-free graphs by double star cutsets and 2-joins

Discrete Applied Mathematics - Brazilian symposium on graphs, algorithms and combinatorics
Graphs of separability at most two: structural characterizations and their consequences

IWOCA'10 Proceedings of the 21st international conference on Combinatorial algorithms
Graphs of separability at most 2

Discrete Applied Mathematics

Quantified Score

Hi-index	0.00

Visualization

Abstract