The following pages link to (Q3312256):
Displaying 30 items.
- Some remarks on the Kronecker product of graphs (Q293407) (← links)
- Primitive zonotopes (Q724942) (← links)
- New sufficient conditions on the degree sequences of uniform hypergraphs (Q831139) (← links)
- Almost nonpreemptive schedules (Q922279) (← links)
- Slender graphs (Q1096653) (← links)
- A new property of critical imperfect graphs and some consequences (Q1104342) (← links)
- On the use of augmenting chains in chain packings (Q1174179) (← links)
- Reduction of indefinite quadratic programs to bilinear programs (Q1187369) (← links)
- The choice probabilities of the latent-scale model satisfy the size-independent model when \(n\) is small. (Q1271091) (← links)
- Random-cluster representation of the Ashkin-Teller model (Q1285073) (← links)
- Colorations généralisées, graphes biorientés et deux ou trois choses sur François. (Generalized colourings, digraphs and some things concerning François) (Q1296153) (← links)
- Restricted coloring models for timetabling (Q1356739) (← links)
- On the Hopf algebra of functional graphs and differential algebras (Q1382822) (← links)
- Analysis of a randomized rendezvous algorithm (Q1398376) (← links)
- On the complexity of graph tree partition problems. (Q1421460) (← links)
- Cabri-graph, a sketchpad for graph theory. (Q1565868) (← links)
- On the logic of unification (Q1823935) (← links)
- Variations sur le thème \({E+\overline {E} = XY}\) (Variations on the theme \({E+\overline {E} = XY})\) (Q1865262) (← links)
- On the strong and the semi-strong path partition conjecture (Q1985941) (← links)
- Chvátal-Erdős conditions for paths and cycles in graphs and digraphs. A survey (Q2277468) (← links)
- The compared costs of domination location-domination and identification (Q2282469) (← links)
- Calculating the Euler characteristic of the moduli space of curves (Q2678453) (← links)
- Coloration de graphes : fondements et applications (Q4809665) (← links)
- First order properties on nowhere dense structures (Q4931094) (← links)
- Minimum identifying codes in some graphs differing by matchings (Q4965914) (← links)
- On the Degree Sequence of 3-Uniform Hypergraph: A New Sufficient Condition (Q5237060) (← links)
- The Kronecker product and local computations in graphs (Q5878897) (← links)
- On the use of graphs in discrete tomography (Q5900894) (← links)
- Reconstruction of domino tiling from its two orthogonal projections (Q5941081) (← links)
- Node rewriting in graphs and hypergraphs: A categorical framework (Q5958766) (← links)
