The following pages link to Elaine M. Eschen (Q531597):
Displayed 28 items.
- 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)
- Algorithms for unipolar and generalized split graphs (Q741738) (← links)
- (Q942109) (redirect page) (← links)
- The \(s\)-Hamiltonian index (Q942110) (← links)
- \(2K_{2}\) vertex-set partition into nonempty parts (Q966027) (← links)
- The induced matching and chain subgraph cover problems for convex bipartite graphs (Q995582) (← links)
- Planar domination graphs (Q1398259) (← links)
- Recognition of some perfectly orderable graph classes (Q1811119) (← links)
- A characterization of some graph classes with no long holes (Q1898735) (← links)
- Finding a sun in building-free graphs (Q1926049) (← links)
- Efficient domination for classes of \(P_6\)-free graphs (Q2030432) (← links)
- Completing colored graphs to meet a target property (Q2030434) (← links)
- Bipartite completion of colored graphs avoiding chordless cycles of given lengths (Q2146743) (← links)
- An \(O( n^{3})\)-time recognition algorithm for hhds-free graphs (Q2373437) (← links)
- (Q2718351) (← links)
- Efficient Domination for Some Subclasses of $$P_6$$ -free Graphs in Polynomial Time (Q2827803) (← links)
- Completing Colored Graphs to Meet a Target Property (Q2864301) (← links)
- (Q3070349) (← links)
- (Q3140413) (← links)
- (Q3424773) (← links)
- Finding Triangles in Restricted Classes of Graphs (Q3439511) (← links)
- 2K2 vertex-set partition into nonempty parts (Q3503567) (← links)
- The Complexity of the List Partition Problem for Graphs (Q3544241) (← links)
- Weakly Triangulated Comparability Graphs (Q4268887) (← links)
- Disjoint clique cutsets in graphs without long holes (Q4676589) (← links)
- (Q4818784) (← links)
- (Q5501285) (← links)