Even-hole-free graph
In the mathematical area of graph theory, a graph is even-hole-free if it contains no induced cycle with an even number of vertices. demonstrated that every even-hole-free graph contains a , which settled a conjecture by Reed.
Link from a Wikipage to another Wikipage
primaryTopic
Even-hole-free graph
In the mathematical area of graph theory, a graph is even-hole-free if it contains no induced cycle with an even number of vertices. demonstrated that every even-hole-free graph contains a , which settled a conjecture by Reed.
has abstract
In the mathematical area of gr ...... settled a conjecture by Reed.
@en
Link from a Wikipage to an external page
Wikipage page ID
17,948,663
page length (characters) of wiki page
Wikipage revision ID
1,022,386,954
Link from a Wikipage to another Wikipage
wikiPageUsesTemplate
subject
comment
In the mathematical area of gr ...... settled a conjecture by Reed.
@en
label
Even-hole-free graph
@en