reducible graph
Recently Published Documents


TOTAL DOCUMENTS

6
(FIVE YEARS 1)

H-INDEX

2
(FIVE YEARS 0)

2021 ◽  
Vol 10 (5) ◽  
pp. 10-14
Author(s):  
Phuc Ngo Tan ◽  
Thanh Tran Ngoc ◽  
Trung Tang Vo Nhat

2012 ◽  
Vol 312 (16) ◽  
pp. 2491-2497
Author(s):  
Michael J. Dorfling

10.37236/490 ◽  
2011 ◽  
Vol 18 (1) ◽  
Author(s):  
Thomas Enkosky

The slope variety of a graph is an algebraic set whose points correspond to drawings of that graph. A complement-reducible graph (or cograph) is a graph without an induced four-vertex path. We construct a bijection between the zeroes of the slope variety of the complete graph on $n$ vertices over $\mathbb{F}_2$, and the complement-reducible graphs on $n$ vertices.


2005 ◽  
Vol 22 ◽  
pp. 267-270
Author(s):  
Noemi C. dos Santos ◽  
Sulamita Klein ◽  
Jayme L. Szwarcfiter

Sign in / Sign up

Export Citation Format

Share Document