Pages that link to "Item:Q1424251"

The following pages link to Linear-time recognition of circular-arc graphs (Q1424251):

Displaying 50 items.

• On the isomorphism problem for Helly circular-arc graphs (Q259081) (← links)
• Efficient and perfect domination on circular-arc graphs (Q324824) (← links)
• Forbidden induced subgraphs of normal Helly circular-arc graphs: characterization and detection (Q344830) (← links)
• Max point-tolerance graphs (Q344833) (← links)
• On recognition of threshold tolerance graphs and their complements (Q344853) (← links)
• Solving the canonical representation and star system problems for proper circular-arc graphs in logspace (Q350727) (← links)
• Graph classes with structured neighborhoods and algorithmic applications (Q392023) (← links)
• Coloring fuzzy circular interval graphs (Q412282) (← links)
• Interval graph representation with given interval and intersection lengths (Q491160) (← links)
• Powers of cycles, powers of paths, and distance graphs (Q531605) (← links)
• On orthogonal ray graphs (Q602682) (← links)
• Linear-time recognition of Helly circular-arc models and graphs (Q627542) (← links)
• A simpler linear-time recognition of circular-arc graphs (Q644807) (← links)
• The complexity of the list homomorphism problem for graphs (Q693060) (← links)
• An efficient certifying algorithm for the Hamiltonian cycle problem on circular-arc graphs (Q719277) (← links)
• A constant factor approximation algorithm for boxicity of circular arc graphs (Q741528) (← links)
• On the structure of certain intersection graphs (Q845675) (← links)
• Locally connected spanning trees in strongly chordal graphs and proper circular-arc graphs (Q864162) (← links)
• Certifying algorithms for recognizing proper circular-arc graphs and unit circular-arc graphs (Q967378) (← links)
• Characterising \((k,\ell )\)-leaf powers (Q968117) (← links)
• Obstacle numbers of graphs (Q977184) (← links)
• The clique operator on circular-arc graphs (Q987670) (← links)
• Recognizing edge clique graphs among interval graphs and probe interval graphs (Q998556) (← links)
• Characterizations and recognition of circular-arc graphs and subclasses: a survey (Q1045049) (← links)
• FO model checking on geometric graphs (Q1631773) (← links)
• List matrix partitions of graphs representing geometric configurations (Q1741515) (← links)
• Canonical representations for circular-arc graphs using flip sets (Q1799215) (← links)
• Integral mixed unit interval graphs (Q1949108) (← links)
• Normal Helly circular-arc graphs and its subclasses (Q1949109) (← links)
• A linear-time algorithm for finding locally connected spanning trees on circular-arc graphs (Q1950396) (← links)
• Avoidable vertices and edges in graphs: existence, characterization, and applications (Q2065802) (← links)
• Distributed interactive proofs for the recognition of some geometric intersection graph classes (Q2097349) (← links)
• Subclasses of circular-arc bigraphs: Helly, normal and proper (Q2132386) (← links)
• 2-nested matrices: towards understanding the structure of circle graphs (Q2152610) (← links)
• Essential obstacles to Helly circular-arc graphs (Q2166233) (← links)
• Disconnected cuts in claw-free graphs (Q2186821) (← links)
• Characterising circular-arc contact \(B_0\)-VPG graphs (Q2192099) (← links)
• A linear-time algorithm for paired-domination on circular-arc graphs (Q2354407) (← links)
• Graphs and digraphs represented by intervals and circular arcs (Q2357159) (← links)
• Extending partial representations of interval graphs (Q2408095) (← links)
• On the hyperbolicity constant of circular-arc graphs (Q2420429) (← links)
• Structural results on circular-arc graphs and circle graphs: a survey and the main open problems (Q2448877) (← links)
• Co-TT graphs and a characterization of split co-TT graphs (Q2448900) (← links)
• Algorithms for clique-independent sets on subclasses of circular-arc graphs (Q2500526) (← links)
• NP-completeness results for edge modification problems (Q2500532) (← links)
• Solving the path cover problem on circular-arc graphs by using an approximation algorithm (Q2581561) (← links)
• Induced disjoint paths in circular-arc graphs in linear time (Q2629233) (← links)
• Succinct encodings for families of interval graphs (Q2661990) (← links)
• Compact representation of interval graphs and circular-arc graphs of bounded degree and chromatic number (Q2680858) (← links)
• Recognizing Threshold Tolerance Graphs in $$O(n^2)$$ Time (Q2945191) (← links)