The following pages link to (Q4193514):
Displaying 50 items.
- A dichotomy for the dominating set problem for classes defined by small forbidden induced subgraphs (Q260042) (← links)
- On realization graphs of degree sequences (Q284753) (← links)
- Computing role assignments of split graphs (Q287443) (← links)
- Finding good 2-partitions of digraphs. I. Hereditary properties (Q290530) (← links)
- Clique cycle-transversals in distance-hereditary graphs (Q299045) (← links)
- Red-blue clique partitions and \((1-1)\)-transversals (Q311567) (← links)
- A unified approach to recognize squares of split graphs (Q313959) (← links)
- Star coloring of graphs with girth at least five (Q343773) (← links)
- Universal \(H\)-colourable graphs (Q367065) (← links)
- Obstructions to partitions of chordal graphs (Q383740) (← links)
- Extending the Gyárfás-Sumner conjecture (Q401488) (← links)
- Excluding pairs of graphs (Q402589) (← links)
- A decidability result for the dominating set problem (Q410736) (← links)
- Colouring, constraint satisfaction, and complexity (Q458466) (← links)
- Complexity of the cluster deletion problem on subclasses of chordal graphs (Q496003) (← links)
- The Dilworth number of auto-chordal bipartite graphs (Q497341) (← links)
- Strict chordal and strict split digraphs (Q516787) (← links)
- Computing the boxicity of a graph by covering its complement by cointerval graphs (Q585228) (← links)
- Space graphs and sphericity (Q595671) (← links)
- Recognizing line-polar bipartite graphs in time \(O(n)\) (Q602675) (← links)
- The hardness of approximating the boxicity, cubicity and threshold dimension of a graph (Q602742) (← links)
- On the Colin de Verdière number of graphs (Q630509) (← links)
- On the forbidden induced subgraph sandwich problem (Q643008) (← links)
- Some properties of edge intersection graphs of single-bend paths on a grid (Q658070) (← links)
- On the SPANNING \(k\)-TREE problem (Q686254) (← links)
- On distance two graphs of upper bound graphs (Q712252) (← links)
- Rainbow graph splitting (Q719272) (← links)
- On the complete width and edge clique cover problems (Q721937) (← links)
- The price of connectivity for cycle transversals (Q739064) (← links)
- Algorithms for unipolar and generalized split graphs (Q741738) (← links)
- Split digraphs (Q764900) (← links)
- Containment relations in split graphs (Q765349) (← links)
- Degree sequences of matrogenic graphs (Q797597) (← links)
- Once more on matrogenic graphs (Q797598) (← links)
- Packing \(r\)-cliques in weighted chordal graphs (Q817141) (← links)
- Satgraphs and independent domination. I (Q818113) (← links)
- Groups that have a partition by commuting subsets (Q831205) (← links)
- Minimum edge ranking spanning trees of split graphs (Q860397) (← links)
- Polar graphs and maximal independent sets (Q860455) (← links)
- Almost nonpreemptive schedules (Q922279) (← links)
- Operator decomposition of graphs and the reconstruction conjecture (Q960949) (← links)
- Minimal split completions (Q967310) (← links)
- Recent developments on graphs of bounded clique-width (Q967317) (← links)
- Decomposing complete edge-chromatic graphs and hypergraphs. Revisited (Q967361) (← links)
- A forbidden subgraph characterization of line-polar bipartite graphs (Q968193) (← links)
- Minimum fill-in and treewidth of split \(+ ke\) and split \(+kv\) graphs (Q972334) (← links)
- Maximum independent sets in subclasses of \(P_{5}\)-free graphs (Q976106) (← links)
- Single-edge monotonic sequences of graphs and linear-time algorithms for minimal completions and deletions (Q1001894) (← links)
- Cubicity, boxicity, and vertex cover (Q1025509) (← links)
- Note on upper bound graphs and forbidden subposets (Q1025563) (← links)
