QR code

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 graph of <em>B</em>}.</p><p>A graph G is perfect if every induced subgraph <em>G'</em> of <em>G...

Volledige beschrijving

Bewaard in:
Hoofdauteur: Ikorong Anouk
Formaat: Artigo
Taal:Inglês
Gepubliceerd in: InaCombS; Universitas Jember; dan Universitas Indonesia 2022-06-01
Reeks:Indonesian Journal of Combinatorics
Onderwerpen:
true pal, parent, berge, the berge problem, the berge index, relative subgraph, uniform graph, bergerian, bergerian subgraph, maximal bergerian subgraph, berge caliber, tackle
Online toegang:http://www.ijc.or.id/index.php/ijc/article/view/140
Tags: Voeg label toe
Geen labels, Wees de eerste die dit record labelt!

Gelijkaardige items