scientific article; zbMATH DE number 969115
From MaRDI portal
Publication:5284584
Recommendations
- Circular colorings of edge-weighted graphs
- scientific article; zbMATH DE number 1839850
- A note on circular colorings of edge-weighted digraphs
- scientific article; zbMATH DE number 1990691
- On \(k\)-coloring of weighted circular-arc graphs
- Hadwiger's conjecture for circular colorings of edge-weighted graphs
- Generalized circular colouring of graphs
- Circular colouring and orientation of graphs
- Circular colouring and graph homomorphism
- Circular coloring of planar digraphs
Cited in
(20)- On \(k\)-coloring of weighted circular-arc graphs
- Computing the clique number of \(a\)-perfect graphs in polynomial time
- Circular chromatic numbers of Mycielski's graphs
- Circular coloring of graphs via linear programming and tabu search
- On the polynomial time computability of the circular-chromatic number for some superclasses of perfect graphs
- Clique and chromatic number of circular-perfect graphs
- scientific article; zbMATH DE number 1228446 (Why is no real title available?)
- A connection between circular colorings and periodic schedules
- Integer round-up property for the chromatic number of some \(h\)-perfect graphs
- Max-coloring of vertex-weighted graphs
- Circular \((5,2)\)-coloring of sparse graphs
- On circular-perfect graphs: a survey
- On a reduction of the interval coloring problem to a series of bandwidth coloring problems
- Resource-sharing system scheduling and circular chromatic number
- scientific article; zbMATH DE number 1839850 (Why is no real title available?)
- A note on circular colorings of edge-weighted digraphs
- Testing superperfection of k-trees
- Hadwiger's conjecture for circular colorings of edge-weighted graphs
- Computing clique and chromatic number of circular-perfect graphs in polynomial time
- Circular colorings of edge-weighted graphs
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5284584)
