Coloring fuzzy circular interval graphs
From MaRDI portal
Publication:412282
DOI10.1016/J.EJC.2011.09.016zbMATH Open1236.05079OpenAlexW2135289535MaRDI QIDQ412282FDOQ412282
Friedrich Eisenbrand, Martin Niemeier
Publication date: 4 May 2012
Published in: European Journal of Combinatorics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.ejc.2011.09.016
Recommendations
Graph algorithms (graph-theoretic aspects) (05C85) Coloring of graphs and hypergraphs (05C15) Fractional graph theory, fuzzy graph theory (05C72)
Cites Work
- Geometric algorithms and combinatorial optimization.
- Linear-time recognition of circular-arc graphs
- Combinatorial optimization. Polyhedra and efficiency (3 volumes)
- Linear-Time Representation Algorithms for Proper Circular-Arc Graphs and Proper Interval Graphs
- The structure of claw-free graphs
- On maximal independent sets of vertices in claw-free graphs
- The stable set polytope of quasi-line graphs
- A REVISION OF MINTY'S ALGORITHM FOR FINDING A MAXIMUM WEIGHT STABLE SET OF A CLAW-FREE GRAPH
- Integer Decomposition for Polyhedra Defined by Nearly Totally Unimodular Matrices
- On the recognition of fuzzy circular interval graphs
- Coloring quasi-line graphs
- Asymptotics of the chromatic number for quasi-line graphs
- A polynomial algorithm for integer programming covering problems satisfying the integer round-up property
- The round-up property of the fractional chromatic number for proper circular arc graphs
- A Simpler Linear-Time Recognition of Circular-Arc Graphs
Cited In (3)
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)