scientific article; zbMATH DE number 969115
From MaRDI portal
Publication:5284584
DOI10.1002/(SICI)1097-0118(199612)23:4%3C365::AID-JGT6%3E3.0.CO;2-PzbMATH Open0870.05018MaRDI QIDQ5284584FDOQ5284584
Authors: Xuding Zhu, Walter A. Deuber 
Publication date: 22 January 1997
Title of this publication is not available (Why is that?)
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
- Title not available (Why is that?)
- Max-coloring of vertex-weighted graphs
- Integer round-up property for the chromatic number of some \(h\)-perfect graphs
- A connection between circular colorings and periodic schedules
- 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
- Title not available (Why is that?)
- Testing superperfection of k-trees
- A note on circular colorings of edge-weighted digraphs
- 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)
