The following pages link to (Q3291037):
Displaying 50 items.
- Algorithms and kernels for \textsc{Feedback Set} problems in generalizations of tournaments (Q329279) (← links)
- Shattering, graph orientations, and connectivity (Q396883) (← links)
- \(k\)-kernels in \(k\)-transitive and \(k\)-quasi-transitive digraphs (Q442356) (← links)
- The structure and metric dimension of the power graph of a finite group (Q458587) (← links)
- Some remarks on the structure of strong \(k\)-transitive digraphs (Q472123) (← links)
- On graphs associated to sets of rankings (Q491081) (← links)
- Proof of Chvátal's conjecture on maximal stable sets and maximal cliques in graphs (Q598473) (← links)
- Counterexamples to three conjectures concerning perfect graphs (Q686172) (← links)
- On the SPANNING \(k\)-TREE problem (Q686254) (← links)
- On the structure of strong 3-quasi-transitive digraphs (Q708416) (← links)
- Dimensions of hypergraphs (Q757427) (← links)
- Decomposing random mechanisms (Q898659) (← links)
- On the complexity of recognizing perfectly orderable graphs (Q918707) (← links)
- Kernels by monochromatic paths in \(m\)-colored unions of quasi-transitive digraphs (Q968164) (← links)
- Proof of Ding's conjecture on maximal stable sets and maximal cliques in planar graphs (Q993683) (← links)
- Some sufficient conditions for the existence of kernels in infinite digraphs (Q1025568) (← links)
- Comparability graphs with constraint, partial semi-orders and interval orders (Q1068108) (← links)
- Alternating orientation and alternating colouration of perfect graphs (Q1089007) (← links)
- Is there a diagram invariant? (Q1115889) (← links)
- \(P_ 4\)-comparability graphs (Q1121924) (← links)
- A structure theory for ordered sets (Q1151913) (← links)
- A condition for a family of triangles to be orientable to a cyclic order (Q1182579) (← links)
- Comparability graphs and a new matroid (Q1235707) (← links)
- Characterization problems for graphs, partially ordered sets, lattices, and families of sets (Q1237785) (← links)
- The complexity of comparability graph recognition and coloring (Q1241524) (← links)
- On a class of posets and the corresponding comparability graphs (Q1247984) (← links)
- Linkages in locally semicomplete digraphs and quasi-transitive digraphs (Q1297397) (← links)
- Modular decomposition and transitive orientation (Q1301738) (← links)
- Posets with large dimension and relatively few critical pairs (Q1319081) (← links)
- Vertex heaviest paths and cycles in quasi-transitive digraphs (Q1356546) (← links)
- The \(C_{3}\)-structure of the tournaments. (Q1426106) (← links)
- Concordance graphs (Q1568783) (← links)
- Kings in quasi-transitive digraphs (Q1584249) (← links)
- Necessary and possible indifferences (Q1690609) (← links)
- Recent results on containment graphs of paths in a tree (Q1752490) (← links)
- Distance-hereditary comparability graphs (Q1759843) (← links)
- Weakly Hamiltonian-connected ordinary multipartite tournaments (Q1842145) (← links)
- MPQ-trees for the orthogonal packing problem (Q1935724) (← links)
- On \(k\)-tree containment graphs of paths in a tree (Q2035089) (← links)
- A recognition algorithm for simple-triangle graphs (Q2185743) (← links)
- Richardson's theorem in quasi-transitive and pre-transitive digraphs (Q2191277) (← links)
- \(H\)-kernels in unions of \(H\)-colored quasi-transitive digraphs (Q2227102) (← links)
- Restricted domination in quasi-transitive and 3-quasi-transitive digraphs (Q2231781) (← links)
- Prime orientable graphs (Q2237224) (← links)
- Chromatic polynomials of oriented graphs (Q2325756) (← links)
- \(k\)-quasi-transitive digraphs of large diameter (Q2413174) (← links)
- Independent sets and non-augmentable paths in generalizations of tournaments (Q2427505) (← links)
- A characterization of \(P_{4}\)-comparability graphs (Q2433707) (← links)
- A note on chordal bound graphs and posets (Q2470467) (← links)
- Kernels in quasi-transitive digraphs (Q2501570) (← links)
