Coloring fuzzy circular interval graphs

DOI10.1016/j.ejc.2011.09.016zbMath1236.05079OpenAlexW2135289535MaRDI QIDQ412282

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

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15) Graph algorithms (graph-theoretic aspects) (05C85) Fractional graph theory, fuzzy graph theory (05C72)

Related Items (2)

Integer round-up property for the chromatic number of some \(h\)-perfect graphs ⋮ Uncertain vertex coloring problem

Cites Work

• Unnamed Item
• On the recognition of fuzzy circular interval graphs
• The stable set polytope of quasi-line graphs
• On maximal independent sets of vertices in claw-free graphs
• Geometric algorithms and combinatorial optimization.
• Linear-time recognition of circular-arc graphs
• Combinatorial optimization. Polyhedra and efficiency (3 volumes)
• 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
• A REVISION OF MINTY'S ALGORITHM FOR FINDING A MAXIMUM WEIGHT STABLE SET OF A CLAW-FREE GRAPH
• Linear-Time Representation Algorithms for Proper Circular-Arc Graphs and Proper Interval Graphs
• The round-up property of the fractional chromatic number for proper circular arc graphs
• Integer Decomposition for Polyhedra Defined by Nearly Totally Unimodular Matrices
• A Simpler Linear-Time Recognition of Circular-Arc Graphs

This page was built for publication: Coloring fuzzy circular interval graphs