The following pages link to (Q4099676):
Displaying 50 items.
- Total dominating sequences in graphs (Q267175) (← links)
- On panchromatic patterns (Q294559) (← links)
- Finite families of forbidden subgraphs for rainbow connection in graphs (Q297932) (← links)
- Cycles and transitivity by monochromatic paths in arc-coloured digraphs (Q321986) (← links)
- Even pairs in square-free Berge graphs (Q322216) (← links)
- \(H\)-kernels by walks in \(H\)-colored digraphs and the color-class digraph (Q334121) (← links)
- On neighborhood-Helly graphs (Q344856) (← links)
- Finding intersection models: from chordal to Helly circular-arc graphs (Q409451) (← links)
- Spectra of uniform hypergraphs (Q417456) (← links)
- \(k\)-kernels in \(k\)-transitive and \(k\)-quasi-transitive digraphs (Q442356) (← links)
- A new characterization of perfect graphs (Q442410) (← links)
- Finding explanations of inconsistency in multi-context systems (Q460632) (← links)
- On embeddings of CAT(0) cube complexes into products of trees via colouring their hyperplanes (Q463287) (← links)
- \(\{0,1\}\) completely positive tensors and multi-hypergraphs (Q501224) (← links)
- Transitive orientations in bull-reducible Berge graphs (Q531595) (← links)
- Claw-free cubic graphs with clique-transversal number half of their order (Q533447) (← links)
- Pósa-condition and nowhere-zero 3-flows (Q536209) (← links)
- Kernels by monochromatic paths in digraphs with covering number 2 (Q539857) (← links)
- On the complexity of enumerating pseudo-intents (Q628340) (← links)
- On some decision problems for trace codings (Q672324) (← links)
- A note on Farin points for rational triangular Bézier patches (Q672478) (← links)
- Analysis of approximate algorithms for edge-coloring bipartite graphs (Q673614) (← links)
- On the SPANNING \(k\)-TREE problem (Q686254) (← links)
- On hypergraphs having evenly distributed subhypergraphs (Q686453) (← links)
- Polynomial-time dualization of \(r\)-exact hypergraphs with applications in geometry (Q708383) (← links)
- Dominating sequences in graphs (Q740654) (← links)
- Tensors, matchings and codes (Q765171) (← links)
- Graphs and free partially commutative monoids (Q803150) (← links)
- Finding dominating cliques efficiently, in strongly chordal graphs and undirected path graphs (Q805638) (← links)
- A global parallel algorithm for the hypergraph transversal problem (Q845919) (← links)
- Reformulation of global constraints based on constraints checkers (Q850448) (← links)
- Hypergraphs and the Clar problem in hexagonal systems (Q865759) (← links)
- On the chromaticity of sunflower hypergraphs \(\text{SH}(n,p,h)\) (Q868346) (← links)
- A characterization of Delsarte's linear programming bound as a ratio bound (Q876308) (← links)
- Cost colourings of hypergraphs (Q878618) (← links)
- Universal sequences for complete graphs (Q918989) (← links)
- Kernels in edge-coloured orientations of nearly complete graphs (Q941406) (← links)
- On the complexity of monotone dualization and generating minimal hypergraph transversals (Q943847) (← links)
- Solving efficiently the 0-1 multi-objective knapsack problem (Q947962) (← links)
- Extremal perfect graphs for a bound on the domination number (Q952634) (← links)
- \(k\)-Ordered Hamilton cycles in digraphs (Q958680) (← links)
- Interactive image segmentation using probabilistic hypergraphs (Q962772) (← links)
- Treewidth computations. I: Upper bounds (Q964001) (← links)
- On minimally \(b\)-imperfect graphs (Q967413) (← links)
- Kernels and some operations in edge-coloured digraphs (Q998342) (← links)
- Minimum partition of an independence system into independent sets (Q1013303) (← links)
- Some sufficient conditions for the existence of kernels in infinite digraphs (Q1025568) (← links)
- Cube intersection concepts in median graphs (Q1025912) (← links)
- Numerical characterization of \(n\)-cube subset partitioning (Q1026122) (← links)
- Independent sets in bounded-degree hypergraphs (Q1026137) (← links)
