Coloring fuzzy circular interval graphs

DOI10.1016/J.EJC.2011.09.016MaRDI QIDQ412282zbMATH OpenOpenAlexFDO

Authors 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

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

Recommendations

• Coloring fuzzy circular interval graphs
• Weighted coloring: further complexity and approximability results
• Theoretical Computer Science
• On \(k\)-coloring of weighted circular-arc graphs
• scientific article; zbMATH DE number 6004918

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)

• Fuzzy colouring of fuzzy graphs
• Coloring fuzzy circular interval graphs
• Uncertain vertex coloring problem
• Integer round-up property for the chromatic number of some \(h\)-perfect graphs

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)