The following pages link to S. K. Merz (Q201980):
Displaying 30 items.
- The (1,2)-step competition graph of a tournament (Q617643) (← links)
- A characterization of graphs with interval two-step graphs (Q1805321) (← links)
- Chromatic numbers of competition graphs (Q1805322) (← links)
- Regular tournaments with minimum split domination number and cycle extendability (Q2089539) (← links)
- A class of local tournaments with interval \((1,2)\)-step competition graphs (Q2799828) (← links)
- (Q2971256) (← links)
- (Q3838209) (← links)
- (Q3838217) (← links)
- (Q4227919) (← links)
- The domination and competition graphs of a tournament (Q4242915) (← links)
- (Q4304373) (← links)
- (Q4386072) (← links)
- (Q4390651) (← links)
- (Q4405779) (← links)
- (Q4430848) (← links)
- (Q4458216) (← links)
- (Q4472696) (← links)
- Competition Graphs of Strongly Connected and Hamiltonian Digraphs (Q4837645) (← links)
- (Q4863414) (← links)
- (Q4863462) (← links)
- (Q4940079) (← links)
- (Q4943524) (← links)
- (Q4977491) (← links)
- (Q5224750) (← links)
- (Q5310220) (← links)
- (Q5405454) (← links)
- (Q5466066) (← links)
- Domination graphs with nontrivial components (Q5943042) (← links)
- Cycle extendability in tournaments (Q6656051) (← links)
- Tight bounds for the split domination number of a nearly regular tournament (Q6658038) (← links)