The following pages link to Complement reducible graphs (Q1153105):
Displaying 50 items.
- On the terminal connection problem (Q831820) (← links)
- The micro-world of cographs (Q831855) (← links)
- Thinness of product graphs (Q831864) (← links)
- Cyclability in graph classes (Q833007) (← links)
- Edge-colouring of joins of regular graphs. I (Q849137) (← links)
- Constructably Laplacian integral graphs (Q876298) (← links)
- Laplacian integral graphs in \(S(a, b)\) (Q876315) (← links)
- On bipartite graphs with weak density of some subgraphs (Q878650) (← links)
- On indicated coloring of graphs (Q897289) (← links)
- Algorithmic aspects of switch cographs (Q906430) (← links)
- Some spectral properties of cographs (Q906470) (← links)
- Primitivity is hereditary for 2-structures (Q913824) (← links)
- Parallel recognition of complement reducible graphs and cotree construction (Q919826) (← links)
- On the complexity of dynamic programming for sequencing problems with precedence constraints (Q922284) (← links)
- On the rank of a cograph (Q929485) (← links)
- The maximum edit distance from hereditary graph properties (Q933672) (← links)
- An improvement on the complexity of factoring read-once Boolean functions (Q944714) (← links)
- Finding Hamiltonian circuits in quasi-adjoint graphs (Q955323) (← links)
- Recent developments on graphs of bounded clique-width (Q967317) (← links)
- First-fit coloring of \(\{P_{5},K_{4}-e\}\)-free graphs (Q968185) (← links)
- A forbidden subgraph characterization of line-polar bipartite graphs (Q968193) (← links)
- Characterizing and computing minimal cograph completions (Q972335) (← links)
- Maximum independent sets in subclasses of \(P_{5}\)-free graphs (Q976106) (← links)
- Clique-width of graphs defined by one-vertex extensions (Q998353) (← links)
- On \(P_4\)-transversals of chordal graphs (Q998435) (← links)
- The stable set polytope for some extensions of \(P_4\)-free graphs (Q998505) (← links)
- Representation of graphs by OBDDs (Q1003666) (← links)
- Structure and stability number of chair-, co-P- and gem-free graphs revisited (Q1007592) (← links)
- On the OBDD size for graphs of bounded tree- and clique-width (Q1011721) (← links)
- The graph sandwich problem for \(P_4\)-sparse graphs (Q1025565) (← links)
- Algorithmic aspects of a general modular decomposition theory (Q1026102) (← links)
- Some optimization problems on weak-bisplit graphs (Q1029034) (← links)
- Efficient robust algorithms for the maximum weight stable set problem in chair-free graph classes (Q1029074) (← links)
- On the b-coloring of cographs and \(P_{4}\)-sparse graphs (Q1043801) (← links)
- A note on a conjecture by Gavril on clique separable graphs (Q1050357) (← links)
- Efficient algorithms for combinatorial problems on graphs with bounded decomposability - a survey (Q1062758) (← links)
- Clustering and domination in perfect graphs (Q1068110) (← links)
- Distance-hereditary graphs (Q1084114) (← links)
- On some complexity properties of N-free posets and posets with bounded decomposition diameter (Q1086264) (← links)
- Locally perfect graphs (Q1105623) (← links)
- Dominating sets in social network graphs (Q1108233) (← links)
- Linear time algorithms for NP-hard problems restricted to partial k- trees (Q1116705) (← links)
- Strong tree-cographs are Birkhoff graphs (Q1119942) (← links)
- Permutation graphs: Connected domination and Steiner trees (Q1174135) (← links)
- Pseudo-median graphs: Decomposition via amalgamation and Cartesian multiplication (Q1182965) (← links)
- A tree representation for \(P_ 4\)-sparse graphs (Q1183332) (← links)
- Finding Hamiltonian paths in cocomparability graphs using the bump number algorithm (Q1198484) (← links)
- Automorphism groups of graphs with forbidden subgraphs (Q1199116) (← links)
- \(P_ 4\)-trees and substitution decomposition (Q1201812) (← links)
- On estimating the number of order ideals in partial orders, with some applications (Q1209661) (← links)
