The following pages link to R. Sritharan (Q198206):
Displaying 45 items.
- Geodeticity of the contour of chordal bipartite graphs (Q324794) (← links)
- Graph modification problem for some classes of graphs (Q350726) (← links)
- On graphs without a \(C_{4}\) or a diamond (Q531598) (← links)
- On the complexity of deciding whether the distinguishing chromatic number of a graph is at most two (Q626859) (← links)
- Strongly chordal and chordal bipartite graphs are sandwich monotone (Q652637) (← links)
- Maximum induced matching problem on hhd-free graphs (Q765362) (← links)
- A new characterization of HH-free graphs (Q942119) (← links)
- On the complexity of the sandwich problems for strongly chordal graphs and chordal bipartite graphs (Q995559) (← links)
- The induced matching and chain subgraph cover problems for convex bipartite graphs (Q995582) (← links)
- Planar domination graphs (Q1398259) (← links)
- On the contour of bipartite graphs (Q1752491) (← links)
- Finding a maximum induced matching in weakly chordal graphs (Q1810638) (← links)
- Recognition of some perfectly orderable graph classes (Q1811119) (← links)
- Dirac-type characterizations of graphs without long chordless cycles (Q1849953) (← links)
- Algorithms for weakly triangulated graphs (Q1891926) (← links)
- A characterization of some graph classes with no long holes (Q1898735) (← links)
- Finding a sun in building-free graphs (Q1926049) (← links)
- Finding and listing induced paths and cycles (Q1941391) (← links)
- A min-max property of chordal bipartite graphs with applications (Q1959718) (← links)
- Completing colored graphs to meet a target property (Q2030434) (← links)
- Bipartite completion of colored graphs avoiding chordless cycles of given lengths (Q2146743) (← links)
- Some completion problems for graphs without chordless cycles of prescribed lengths (Q2274074) (← links)
- An \(O( n^{3})\)-time recognition algorithm for hhds-free graphs (Q2373437) (← links)
- Chordal bipartite completion of colored graphs (Q2427516) (← links)
- A note on the recognition of bisplit graphs (Q2501548) (← links)
- Completing Colored Graphs to Meet a Target Property (Q2864301) (← links)
- Improved algorithms for weakly chordal graphs (Q2944551) (← links)
- New Min-Max Theorems for Weakly Chordal and Dually Chordal Graphs (Q3066459) (← links)
- (Q3424773) (← links)
- The Complexity of the List Partition Problem for Graphs (Q3544241) (← links)
- Leaf Powers and Their Properties: Using the Trees (Q3596736) (← links)
- Weakly Triangulated Comparability Graphs (Q4268887) (← links)
- (Q4604131) (← links)
- (Q4635984) (← links)
- Disjoint clique cutsets in graphs without long holes (Q4676589) (← links)
- A linear time algorithm to recognize circular permutation graphs (Q4887747) (← links)
- (Q4952597) (← links)
- Structure and linear-time recognition of 4-leaf powers (Q4962769) (← links)
- Strongly Chordal and Chordal Bipartite Graphs Are Sandwich Monotone (Q5323088) (← links)
- Hamiltonian Spider Intersection Graphs Are Cycle Extendable (Q5408600) (← links)
- (Q5501285) (← links)
- Cycle Extendability and Hamiltonian Cycles in Chordal Graph Classes (Q5757384) (← links)
- Finding houses and holes in graphs (Q5941278) (← links)
- On some classes of quasi-triangulated graphs (Q6633557) (← links)
- Intersection of chordal graphs and some related partition problems (Q6657232) (← links)
