Pages that link to "Item:Q4071258"
From MaRDI portal
The following pages link to Coloring a Family of Circular Arcs (Q4071258):
Displayed 50 items.
- Forbidden induced subgraphs of normal Helly circular-arc graphs: characterization and detection (Q344830) (← links)
- Catalan structures and dynamic programming in \(H\)-minor-free graphs (Q440008) (← links)
- Cyclic orders (Q583246) (← links)
- Boxicity of circular arc graphs (Q659754) (← links)
- Two remarks on circular arc graphs (Q675889) (← links)
- On a circle-cover minimization problem (Q790622) (← links)
- The edge intersection graphs of paths in a tree (Q792348) (← links)
- On circular critical graphs (Q796546) (← links)
- On the structure of certain intersection graphs (Q845675) (← links)
- On the complexity of bandwidth allocation in radio networks (Q952444) (← links)
- 1.5-Approximation algorithm for weighted maximum routing and wavelength assignment on rings (Q976131) (← links)
- Coloring geometric range spaces (Q1017922) (← links)
- Wavelength routing of uniform instances in all-optical rings (Q1019297) (← links)
- Hadwiger's conjecture for proper circular arc graphs (Q1024291) (← links)
- Efficient algorithms for wavelength assignment on trees of rings (Q1028409) (← links)
- Finding Hamiltonian circuits in proper interval graphs (Q1050117) (← links)
- On the chromatic number of multiple interval graphs and overlap graphs (Q1061131) (← links)
- Covering and coloring problems for relatives of intervals (Q1061132) (← links)
- Dominating sets and domatic number of circular arc graphs (Q1066921) (← links)
- A reduction procedure for coloring perfect \(K_ 4\)-free graphs (Q1096639) (← links)
- Algorithmic aspects of intersection graphs and representation hypergraphs (Q1119661) (← links)
- An 0(n log n\(+m\,\log \,\log \,n)\) maximum weight clique algorithm for circular-arc graphs (Q1123622) (← links)
- Graphical properties related to minimal imperfection (Q1132889) (← links)
- A classification of certain graphs with minimal imperfection properties (Q1160632) (← links)
- On stable set polyhedra for K//(1,3)free graphs (Q1168982) (← links)
- A Turán-type theorem on chords of a convex polygon (Q1204472) (← links)
- Efficient parallel recognition of some circular arc graphs. I (Q1209733) (← links)
- Critical perfect graphs and perfect 3-chromatic graphs (Q1245851) (← links)
- On a graph-theoretical model for cyclic register allocation (Q1296576) (← links)
- Algorithms for preemptive scheduling of different classes of processors to do jobs with fixed times (Q1310017) (← links)
- Periodic assignment and graph colouring (Q1329789) (← links)
- The permutation-path coloring problem on trees. (Q1401295) (← links)
- An approach to solving \(A^{k}=J-I\) (Q1414133) (← links)
- Completeness for intersection classes (Q1584399) (← links)
- Splittable traffic partition in WDM/SONET rings to minimize SONET ADMs (Q1605303) (← links)
- Conversion of coloring algorithms into maximum weight independent set algorithms (Q1775063) (← links)
- Partitionable graphs, circle graphs, and the Berge strong perfect graph conjecture (Q1837210) (← links)
- Efficient approximation algorithms for domatic partition and on-line coloring of circular arc graphs (Q1917245) (← links)
- Intersection graphs of Helly families of subtrees (Q1917300) (← links)
- Normal Helly circular-arc graphs and its subclasses (Q1949109) (← links)
- A note on the Hadwiger number of circular arc graphs (Q2379986) (← links)
- Perfect circular arc coloring (Q2569164) (← links)
- (Q2741507) (← links)
- (Q2861542) (← links)
- Algorithms for Necklace Maps (Q2950591) (← links)
- Interval Routing Schemes for Circular-Arc Graphs (Q2979675) (← links)
- Graphs with Large Obstacle Numbers (Q3057633) (← links)
- Lexicographic Orientation Algorithms (Q3120444) (← links)
- An $O(n^2 )$ Algorithm for Coloring Proper Circular Arc Graphs (Q3960133) (← links)
- The Complexity of Coloring Circular Arcs and Chords (Q3964622) (← links)