Coloring fuzzy circular interval graphs
From MaRDI portal
Recommendations
Cites work
- A REVISION OF MINTY'S ALGORITHM FOR FINDING A MAXIMUM WEIGHT STABLE SET OF A CLAW-FREE GRAPH
- A Simpler Linear-Time Recognition of Circular-Arc Graphs
- A polynomial algorithm for integer programming covering problems satisfying the integer round-up property
- Coloring quasi-line graphs
- Combinatorial optimization. Polyhedra and efficiency (3 volumes)
- Geometric algorithms and combinatorial optimization.
- Integer Decomposition for Polyhedra Defined by Nearly Totally Unimodular Matrices
- Linear-Time Representation Algorithms for Proper Circular-Arc Graphs and Proper Interval Graphs
- Linear-time recognition of circular-arc graphs
- On maximal independent sets of vertices in claw-free graphs
- On the recognition of fuzzy circular interval graphs
- The round-up property of the fractional chromatic number for proper circular arc graphs
- The stable set polytope of quasi-line graphs
- The structure of claw-free graphs
Cited in
(4)
This page was built for publication: Coloring fuzzy circular interval graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q412282)