The following pages link to Complement reducible graphs (Q1153105):
Displaying 50 items.
- Minimal obstructions to \(( s , 1 )\)-polarity in cographs (Q2184672) (← links)
- Characterizations, probe and sandwich problems on \(( k , \ell )\)-cographs (Q2184673) (← links)
- Integral cographs (Q2192073) (← links)
- Generalized Fitch graphs. II: Sets of binary relations that are explained by edge-labeled trees (Q2192103) (← links)
- Maximizing the strong triadic closure in split graphs and proper interval graphs (Q2197407) (← links)
- Solutions for subset sum problems with special digraph constraints (Q2216192) (← links)
- How to compute digraph width measures on directed co-graphs (Q2220888) (← links)
- Counting subset repairs with functional dependencies (Q2221807) (← links)
- \((k,l)\)-colourings and Ferrers diagram representations of cographs (Q2225413) (← links)
- Correcting the algorithm for the secure domination number of cographs by Jha, Pradhan, and Banerjee (Q2234781) (← links)
- Efficient computation of the oriented chromatic number of recursively defined digraphs (Q2235732) (← links)
- Coherent network partitions: characterizations with cographs and prime graphs (Q2243575) (← links)
- Some new classes of open distance-pattern uniform graphs (Q2248722) (← links)
- On the complexity of the independent set problem in triangle graphs (Q2275391) (← links)
- Partitioning a graph into convex sets (Q2275456) (← links)
- Finitely forcible graphons (Q2275893) (← links)
- Characterization of general position sets and its applications to cographs and bipartite graphs (Q2279405) (← links)
- Complexity of modification problems for reciprocal best match graphs (Q2290642) (← links)
- Reciprocal best match graphs (Q2299268) (← links)
- Online coloring a token graph (Q2303438) (← links)
- Best match graphs and reconciliation of gene trees with species trees (Q2303745) (← links)
- A multivariate analysis of the strict terminal connection problem (Q2306846) (← links)
- Solutions for the knapsack problem with conflict and forcing graphs of bounded clique-width (Q2311126) (← links)
- Alternative characterizations of Fitch's xenology relation (Q2315209) (← links)
- Cographs: eigenvalues and Dilworth number (Q2317646) (← links)
- Unsmoothable group actions on compact one-manifolds (Q2319579) (← links)
- Generalized Fitch graphs: edge-labeled graphs that are explained by edge-labeled trees (Q2322864) (← links)
- Laplacian integrality in \(P_4\)-sparse and \(P_4\)-extendible graphs (Q2323491) (← links)
- Perfect Roman domination in graphs (Q2333784) (← links)
- On the double Roman domination of graphs (Q2335792) (← links)
- On the spectrum and number of convex sets in graphs (Q2339431) (← links)
- Extending the MAX algorithm for maximum independent set (Q2344024) (← links)
- New sufficient conditions for \(\alpha\)-redundant vertices (Q2346329) (← links)
- On maximum independent set of categorical product and ultimate categorical ratios of graphs (Q2348262) (← links)
- Partitioning a graph into disjoint cliques and a triangle-free graph (Q2352776) (← links)
- Knocking out \(P_k\)-free graphs (Q2352787) (← links)
- One-three join: a graph operation and its consequences (Q2364085) (← links)
- A characterization and hereditary properties for partition graphs (Q2366015) (← links)
- Handle-rewriting hypergraph grammars (Q2366278) (← links)
- A faster parallel connectivity algorithm on cographs (Q2371145) (← links)
- Recognizing well covered graphs of families with special \(P _{4}\)-components (Q2376085) (← links)
- 4-coloring \((P_6, \text{bull})\)-free graphs (Q2403807) (← links)
- Minimal asymmetric graphs (Q2407386) (← links)
- On the thinness and proper thinness of a graph (Q2414456) (← links)
- Secure domination in cographs (Q2416434) (← links)
- Simple permutations and algebraic generating functions (Q2426423) (← links)
- Fixed-parameter algorithms for the cocoloring problem (Q2440099) (← links)
- Nordhaus-Gaddum bounds for locating domination (Q2441609) (← links)
- On the complexity of the black-and-white coloring problem on some classes of perfect graphs (Q2445872) (← links)
- Computing square roots of trivially perfect and threshold graphs (Q2446337) (← links)
