The following pages link to Shinsei Tazawa (Q698027):
Displaying 29 items.
- Enumeration of connected graphs with cut vertices (Q698029) (← links)
- On the consecutive retrieval property for generalized binary queries (Q799135) (← links)
- Enumeration of digraphs with given number of vertices of odd out-degree and vertices of odd in-degree (Q810045) (← links)
- Claw-decomposition and evenly-partite-claw-decomposition of complete multi-partite graphs (Q1132104) (← links)
- A series of search designs for \(2^ m\) factorial designs of resolution V which permit search of one or two unknown extra three-factor interactions (Q1206646) (← links)
- Partition of a query set into minimal number of subsets having consecutive retrieval property (Q1238649) (← links)
- Partite-claw-decomposition of a complete multi-partite graph (Q1247979) (← links)
- On claw-decomposition of a complete multi-partite graph (Q1247980) (← links)
- Enumeration of unlabelled bicolored graphs by degree parities (Q1361672) (← links)
- Enumeration of unlabelled graphs with specified degree parities (Q1382832) (← links)
- On separable self-complementary graphs (Q1850001) (← links)
- The number of 4-cycles in triangle-free oriented graphs (Q1897447) (← links)
- (Q3178889) (← links)
- (Q3339331) (← links)
- (Q3565939) (← links)
- (Q3676175) (← links)
- Decomposition of a Complete Multi-Partite Graph into Isomorphic Claws (Q3708843) (← links)
- (Q3760573) (← links)
- (Q3801581) (← links)
- (Q3862425) (← links)
- Hyperclaw Decomposition of Complete Hypergraphs (Q3907604) (← links)
- (Q4285715) (← links)
- (Q4298650) (← links)
- (Q4697325) (← links)
- Design of file organization schemes for selected query set on binary-valued attributes and their redundancies (Q4746815) (← links)
- (Q4894972) (← links)
- (Q5199939) (← links)
- A new counting methods, including the issue of counting labelled self-complementary graphs (Q5500085) (← links)
- Enumeration of bipartite self-complementary graphs (Q5895187) (← links)
