Product
Help
Pricing
About
Jobs
Log in
Get started
Keyword
Add to collection
odd holes
Description:
Odd holes are induced cycles of odd length, typically at least five vertices, studied in graph theory.
Primary topic:
Advanced Graph Theory Research (79%)
Related topics:
Advanced Graph Theory Research (79%),
Complexity and Algorithms in Graphs (12%)
OpenAlex ID:
keywords/odd-holes
Index Coding With Side Information
2011
·
Ziv Bar-Yossef
, Yitzhak Birk
, et al.
·
IEEE Transactions on Information Theory
·
540
A class of facet producing graphs for vertex packing polyhedra
1975
·
L.E. Trotter
·
Discrete Mathematics
·
178
PDF
On the complexity of testing for odd holes and induced odd paths
1991
·
Dan Bienstock
·
Discrete Mathematics
·
146
The strong perfect-graph conjecture is true for K1,3-free graphs
1976
·
K.R. Parthasarathy
, G. Ravindra
·
Journal of Combinatorial Theory Series B
·
138
On the asymmetric representatives formulation for the vertex coloring problem
2007
·
Manoel Campêlo
, Victor A. Campos
, et al.
·
Discrete Applied Mathematics
·
126
PDF
Induced subgraphs of graphs with large chromatic number. I. Odd holes
2015
·
Alex Scott
, Paul Seymour
·
Journal of Combinatorial Theory Series B
·
94
The Optimal Cost Chromatic Partition problem for trees and interval graphs
1997
·
Leo G. Kroon
, Arunabha Sen
, et al.
·
Lecture notes in computer science
·
90
Coloring the Maximal Cliques of Graphs
2004
·
Gábor Bacsó
, Sylvain Gravier
, et al.
·
SIAM Journal on Discrete Mathematics
·
86
Facets of the three-index assignment polytope
1989
·
Egon Balas
, Matthew J. Saltzman
·
Discrete Applied Mathematics
·
86
Transformations which Preserve Perfectness and H-Perfectness of Graphs
1982
·
J. Fonlupt
, J.P. Uhry
·
North-Holland mathematics studies
·
84
Cliques, holes and the vertex coloring polytope
2003
·
Manoel Campêlo
, Ricardo Corrêa
, et al.
·
Information Processing Letters
·
81
On stable set polyhedra for K1,3-free graphs
1981
·
Rick Giles
, L.E Trotter
·
Journal of Combinatorial Theory Series B
·
72
A semi-strong Perfect Graph theorem
1987
·
B Reed
·
Journal of Combinatorial Theory Series B
·
62
On the Perfect Graph Theorem
1973
·
D.R. FULKERSON
·
Elsevier eBooks
·
62
Classes of perfect graphs
2006
·
Stefan Hougardy
·
Discrete Mathematics
·
61
Graph Imperfection
2001
·
Stefanie Gerke
, Colin McDiarmid
·
Journal of Combinatorial Theory Series B
·
59
On the divisibility of graphs
2002
·
Chı́nh T. Hoàng
, Colin McDiarmid
·
Discrete Mathematics
·
57
PDF
Algorithms for Finding an Induced Cycle in Planar Graphs and Bounded Genus Graphs
2009
·
Yusuke Kobayashi
, Ken-ichi Kawarabayashi
·
ACM-SIAM Symposium on Discrete Algorithms (SODA)
·
56
Associated primes of monomial ideals and odd holes in graphs
2010
·
Christopher A. Francisco
, Huy Tài Hà
, et al.
·
Journal of Algebraic Combinatorics
·
54
PDF
A Polynomial Turing-Kernel for Weighted Independent Set in Bull-Free Graphs
2015
·
Stéphan Thomassé
, Nicolas Trotignon
, et al.
·
Algorithmica
·
53
PDF
Even and odd holes in cap-free graphs
1999
·
Michele Conforti
, G�rard Cornu�jols
, et al.
·
Journal of Graph Theory
·
52
Algorithms for Perfectly Contractile Graphs
2005
·
Frédéric Maffray
, Nicolas Trotignon
·
SIAM Journal on Discrete Mathematics
·
49
PDF
K 4 -free graphs with no odd holes
2009
·
Maria Chudnovsky
, Neil Robertson
, et al.
·
Journal of Combinatorial Theory Series B
·
45
PDF
On the stable set polytope of a series-parallel graph
1988
·
A. R. Mahjoub
·
Mathematical Programming
·
42
Recognizing planar perfect graphs
1987
·
Wen-Lian Hsu
·
Journal of the ACM
·
42
PDF
Show more works
View as search
Works count:
197
Citation count:
3,505
Year
Topic
Type