Coloring a Family of Circular Arcs
From MaRDI portal
Publication:4071258
Cited in
(55)- Lexicographic orientation algorithms
- Fractional path coloring in bounded degree trees with applications
- Critical perfect graphs and perfect 3-chromatic graphs
- Circular-arc graph coloring: On chords and circuits in the meeting graph
- On a circle-cover minimization problem
- Periodic assignment and graph colouring
- A Turán-type theorem on chords of a convex polygon
- On the chromatic number of multiple interval graphs and overlap graphs
- Completeness for intersection classes
- Algorithms for Necklace Maps
- Hadwiger's conjecture for proper circular arc graphs
- Boxicity of circular arc graphs
- Covering and coloring problems for relatives of intervals
- Forbidden induced subgraphs of normal Helly circular-arc graphs: characterization and detection
- Algorithms for preemptive scheduling of different classes of processors to do jobs with fixed times
- Cyclic orders
- Finding Hamiltonian circuits in proper interval graphs
- An approach to solving \(A^{k}=J-I\)
- Perfect circular arc coloring
- Circular-arc bigraphs and its subclasses
- Efficient parallel recognition of some circular arc graphs. I
- On the complexity of bandwidth allocation in radio networks
- Balancedness of some subclasses of circular-arc graphs
- On a graph-theoretical model for cyclic register allocation
- Algorithmic aspects of intersection graphs and representation hypergraphs
- Partitionable graphs, circle graphs, and the Berge strong perfect graph conjecture
- The permutation-path coloring problem on trees.
- On the structure of certain intersection graphs
- Graphs with large obstacle numbers
- 1.5-Approximation algorithm for weighted maximum routing and wavelength assignment on rings
- An 0(n log n\(+m\,\log \,\log \,n)\) maximum weight clique algorithm for circular-arc graphs
- An $O(n^2 )$ Algorithm for Coloring Proper Circular Arc Graphs
- Two remarks on circular arc graphs
- Efficient approximation algorithms for domatic partition and on-line coloring of circular arc graphs
- On coloring problems with local constraints
- Wavelength routing of uniform instances in all-optical rings
- Splittable traffic partition in WDM/SONET rings to minimize SONET ADMs
- Catalan structures and dynamic programming in \(H\)-minor-free graphs
- Graphical properties related to minimal imperfection
- A classification of certain graphs with minimal imperfection properties
- Intersection graphs of Helly families of subtrees
- A reduction procedure for coloring perfect \(K_ 4\)-free graphs
- The edge intersection graphs of paths in a tree
- The complexity of path coloring and call scheduling
- Dominating sets and domatic number of circular arc graphs
- Revisiting Tucker's algorithm to color circular-arc graphs
- Interval routing schemes for circular-arc graphs
- Normal Helly circular-arc graphs and its subclasses
- A note on the Hadwiger number of circular arc graphs
- Coloring geometric range spaces
- On stable set polyhedra for K//(1,3)free graphs
- Conversion of coloring algorithms into maximum weight independent set algorithms
- The Complexity of Coloring Circular Arcs and Chords
- On circular critical graphs
- Efficient algorithms for wavelength assignment on trees of rings
This page was built for publication: Coloring a Family of Circular Arcs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4071258)
