The complete short proof of the Berge conjecture

The complete short proof of the Berge conjecture

<p>We say that a graph <em>B</em> is berge if every graph <em>B'</em> ∈ {<em>B</em>,<em>B̄</em><em></em>} does not contain an induced cycle of odd length ≥ 5 [<span><em>B̄</em></span> is the complementary...

Full description

Bibliographic Details
Main Author: Ikorong Anouk
Format: Article
Language:English
Published: InaCombS; Universitas Jember; dan Universitas Indonesia 2022-06-01
Series:Indonesian Journal of Combinatorics
Subjects:
true pal, parent, berge, the berge problem, the berge index, relative subgraph, uniform graph, bergerian, bergerian subgraph, maximal bergerian subgraph, berge caliber, tackle
Online Access:http://www.ijc.or.id/index.php/ijc/article/view/140

Internet

http://www.ijc.or.id/index.php/ijc/article/view/140

Similar Items