The following pages link to (Q3941433):
Displaying 50 items.
- Shortest coverings of graphs with cycles (Q802571) (← links)
- Clique graphs and Helly graphs (Q802632) (← links)
- Perfectly contractile graphs (Q803147) (← links)
- On Ringeisen's isolation game. II (Q804481) (← links)
- A deletion game on hypergraphs (Q805510) (← links)
- On the existence of (k,\(\ell)\)-kernels in digraphs (Q805626) (← links)
- On total functions, existence theorems and computational complexity (Q808245) (← links)
- Orientations of graphs in kernel theory (Q809100) (← links)
- On graphic and 3-hypergraphic sequences (Q809101) (← links)
- Vicinal orders of trees (Q810522) (← links)
- Properties of optimal survivable paths in a graph (Q814315) (← links)
- Two party immediate response disputes: Properties and efficiency (Q814510) (← links)
- \((p,k)\)-coloring problems in line graphs (Q817821) (← links)
- Rearrangeability of bit permutation networks (Q818130) (← links)
- Networks beyond pairwise interactions: structure and dynamics (Q823239) (← links)
- Depth of nodes in random recursive \(k\)-ary trees (Q844171) (← links)
- On the number of broadcast schemes in networks (Q845865) (← links)
- Coloring some classes of mixed graphs (Q858294) (← links)
- Tangent circle graphs and `orders' (Q869563) (← links)
- Potentially \(K_{r_{1},r_{2},\dots ,r_{l},r,s}\)-graphic sequences (Q870982) (← links)
- On chromaticity of hypergraphs (Q878636) (← links)
- A method of finding automorphism groups of endomorphism monoids of relational systems. (Q879337) (← links)
- Harary index and some Hamiltonian properties of graphs (Q896102) (← links)
- Growth problems for avoidable words (Q908709) (← links)
- A data structure useful for finding Hamiltonian cycles (Q909446) (← links)
- A distributed synchronization scheme for fair multi-process handshakes (Q910197) (← links)
- A parallel algorithm for eliminating cycles in undirected graphs (Q910243) (← links)
- Pfaffian orientations, 0-1 permanents, and even cycles in directed graphs (Q911300) (← links)
- Dynamic maintenance of directed hypergraphs (Q913481) (← links)
- On the complexity of algorithms on recursive trees (Q914392) (← links)
- A universal table model for categorical databases (Q918682) (← links)
- A logic-based analysis of Dempster-Shafer theory (Q918733) (← links)
- An algebra of probability over finite product spaces, with applications (Q919365) (← links)
- Incomparability in parallel computation (Q919822) (← links)
- Minimizing the number of tardy job units under release time constraints (Q919993) (← links)
- Circular balanced uniform repeated measurements designs. II (Q920519) (← links)
- Lifting facets of the cut polytope (Q923115) (← links)
- Approximability results for the maximum and minimum maximal induced matching problems (Q937401) (← links)
- Self-duality of bounded monotone Boolean functions and related problems (Q944707) (← links)
- A tutorial on the use of graph coloring for some problems in robotics (Q948648) (← links)
- On 2-factors with \(k\) components (Q952657) (← links)
- The 0-1 inverse maximum stable set problem (Q955316) (← links)
- A short constructive proof of the Erdős-Gallai characterization of graphic lists (Q965964) (← links)
- On the complexity of recognizing directed path families (Q967290) (← links)
- Bounds and conjectures for the signless Laplacian index of graphs (Q968999) (← links)
- On handshakes in random graphs (Q975422) (← links)
- Minimum sum edge colorings of multicycles (Q987666) (← links)
- Approximation of min coloring by moderately exponential algorithms (Q989534) (← links)
- A note on \(t\)-complementing permutations for graphs (Q990101) (← links)
- Making choices with a binary relation: relative choice axioms and transitive closures (Q992691) (← links)
