Pages that link to "Item:Q4877525"

The following pages link to Linear-Time Representation Algorithms for Proper Circular-Arc Graphs and Proper Interval Graphs (Q4877525):

Displaying 40 items.

• Graphs and digraphs represented by intervals and circular arcs (Q2357159) (← links)
• On the thinness and proper thinness of a graph (Q2414456) (← links)
• A dichotomy for minimum cost graph homomorphisms (Q2427539) (← links)
• The \(k\)-in-a-path problem for claw-free graphs (Q2428671) (← links)
• Recognition of probe proper interval graphs (Q2440119) (← links)
• Finding a smallest odd hole in a claw-free graph using global structure (Q2444540) (← links)
• The Roberts characterization of proper and unit interval graphs (Q2461218) (← links)
• NP-completeness results for edge modification problems (Q2500532) (← links)
• Shortest reconfiguration of sliding tokens on subclasses of interval graphs (Q2658043) (← links)
• Shortest Reconfiguration of Sliding Tokens on a Caterpillar (Q2803826) (← links)
• A new representation of proper interval graphs with an application to clique-width (Q2839207) (← links)
• Proper Interval Vertex Deletion (Q3058706) (← links)
• Lexicographic Orientation Algorithms (Q3120444) (← links)
• On partitioning interval graphs into proper interval subgraphs and related problems (Q3174235) (← links)
• Asymptotics of the chromatic number for quasi-line graphs (Q3503489) (← links)
• Partial Characterizations of Circular-Arc Graphs (Q3503529) (← links)
• Proper Helly Circular-Arc Graphs (Q3508572) (← links)
• A Simple Linear Time Algorithm for the Isomorphism Problem on Proper Circular-Arc Graphs (Q3512472) (← links)
• Bounding χ in terms of ω and Δ for quasi-line graphs (Q3605150) (← links)
• Random Generation and Enumeration of Proper Interval Graphs (Q3605496) (← links)
• A Fully Dynamic Graph Algorithm for Recognizing Proper Interval Graphs (Q3605497) (← links)
• Partial characterizations of circular-arc graphs (Q3652535) (← links)
• Lexicographic orientation and representation algorithms for comparability graphs, proper circular arc graphs, and proper interval graphs (Q4857436) (← links)
• Claw‐Free Graphs, Skeletal Graphs, and a Stronger Conjecture on ω, Δ, and χ (Q4982280) (← links)
• Circularly Compatible Ones, $D$-Circularity, and Proper Circular-Arc Bigraphs (Q4986807) (← links)
• The Persistent Homology of Cyclic Graphs (Q5057657) (← links)
• (Q5075828) (← links)
• Maximizing the strong triadic closure in split graphs and proper interval graphs (Q5136273) (← links)
• Induced Disjoint Paths in Claw-Free Graphs (Q5251566) (← links)
• From a Circular-Arc Model to a Proper Circular-Arc Model (Q5302066) (← links)
• Circular‐Arc Bigraphs and Its Subclasses (Q5325948) (← links)
• Template-driven rainbow coloring of proper interval graphs (Q5896886) (← links)
• Template-driven rainbow coloring of proper interval graphs (Q5925620) (← links)
• Intersection graphs of non-crossing paths (Q6041577) (← links)
• Recognizing Proper Tree-Graphs (Q6089652) (← links)
• Efficient non-isomorphic graph enumeration algorithms for several intersection graph classes (Q6549667) (← links)
• Recognition and isomorphism of proper \(H \)-graphs for unicyclic \(H\) in \textit{FPT}-time (Q6575404) (← links)
• Exactly hittable interval graphs (Q6599815) (← links)
• On characterization and recognition of proper tagged probe interval graphs (Q6641094) (← links)
• Modification problems toward proper (Helly) circular-arc graphs (Q6647753) (← links)