The following pages link to (Q5503435):
Displaying 50 items.
- Finding a chain graph in a bipartite permutation graph (Q284350) (← links)
- Forbidden induced subgraphs of normal Helly circular-arc graphs: characterization and detection (Q344830) (← links)
- Ferrers dimension of grid intersection graphs (Q344841) (← links)
- Edge contractions in subclasses of chordal graphs (Q423902) (← links)
- Subgraph isomorphism in graph classes (Q456655) (← links)
- Certifying algorithms (Q465678) (← links)
- Some new considerations about double nested graphs (Q490902) (← links)
- Approximate association via dissociation (Q505447) (← links)
- A polynomial-time algorithm for the maximum cardinality cut problem in proper interval graphs (Q509888) (← links)
- Strict chordal and strict split digraphs (Q516787) (← links)
- \(1\)-perfectly orientable graphs and graph products (Q526271) (← links)
- Cover-incomparability graphs and chordal graphs (Q602752) (← links)
- Linear-time certifying algorithms for the path cover and Hamiltonian cycle problems on interval graphs (Q628259) (← links)
- An efficient certifying algorithm for the Hamiltonian cycle problem on circular-arc graphs (Q719277) (← links)
- Counting and enumerating independent sets with applications to combinatorial optimization problems (Q784784) (← links)
- Polynomial-time algorithms for subgraph isomorphism in small graph classes of perfect graphs (Q896655) (← links)
- The \(k\)-hop connected dominating set problem: approximation and hardness (Q1679503) (← links)
- The maximum cardinality cut problem in co-bipartite chain graphs (Q1698075) (← links)
- Finding a potential community in networks (Q1737592) (← links)
- Characterization and recognition of Radon-independent sets in split graphs (Q1941699) (← links)
- Role coloring bipartite graphs (Q2081494) (← links)
- Algorithms for maximum internal spanning tree problem for some graph classes (Q2091107) (← links)
- Transitivity on subclasses of bipartite graphs (Q2104170) (← links)
- Betti numbers and anti-lecture Hall compositions of random threshold graphs (Q2171873) (← links)
- Structural parameters for scheduling with assignment restrictions (Q2205947) (← links)
- Recognition of split-graphic sequences (Q2254547) (← links)
- Edge deletion problems: branching facilitated by modular decomposition (Q2257301) (← links)
- The complexity of the defensive domination problem in special graph classes (Q2279988) (← links)
- Approximating the path-distance-width for AT-free graphs and graphs in related classes (Q2442209) (← links)
- Acyclic matching in some subclasses of graphs (Q2680984) (← links)
- A simple certifying algorithm for 3-edge-connectivity (Q2689444) (← links)
- Solving Matching Problems Efficiently in Bipartite Graphs (Q2946048) (← links)
- Positional Dominance: Concepts and Algorithms (Q2971635) (← links)
- Edge Contractions in Subclasses of Chordal Graphs (Q3010431) (← links)
- Approximability of the Path-Distance-Width for AT-free Graphs (Q3104783) (← links)
- Competitive Diffusion on Weighted Graphs (Q3449840) (← links)
- A Graph Theoretic Approach to Solve Special Knapsack Problems in Polynomial Time (Q4685763) (← links)
- Fast Diameter Computation within Split Graphs (Q5024674) (← links)
- Acyclic Matching in Some Subclasses of Graphs (Q5041209) (← links)
- On the Complexity of Finding a Potential Community (Q5283357) (← links)
- Graph Classes and Forbidden Patterns on Three Vertices (Q5855535) (← links)
- On a Verification Framework for Certifying Distributed Algorithms: Distributed Checking and Consistency (Q5881540) (← links)
- On the complexity of minimum maximal uniquely restricted matching (Q5918362) (← links)
- Letter graphs and geometric grid classes of permutations: characterization and recognition (Q5918890) (← links)
- Hardness and structural results for half-squares of restricted tree convex bipartite graphs (Q5919674) (← links)
- On minimal forbidden subgraph characterizations of balanced graphs (Q5920323) (← links)
- Certifying fully dynamic algorithms for recognition and Hamiltonicity of threshold and chain graphs (Q6174822) (← links)
- Complexity of total dominator coloring in graphs (Q6184152) (← links)
- Computation of Grundy dominating sequences in (co-)bipartite graphs (Q6184795) (← links)
- Some new algorithmic results on co-secure domination in graphs (Q6190005) (← links)
