Lovász conjecture

Known as: Lovasz conjecture, Lovász

In graph theory, the Lovász conjecture (1969) is a classical problem on Hamiltonian paths in graphs. It says: Every finite connected vertex…

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.

2018

In this paper, we present a minimal chordal completion $G^*$ of a graph $G$ satisfying the inequality $\omega(G^*) - \omega(G…

2017

In 1972, Erdos - Faber - Lovasz (EFL) conjectured that, if $\textbf{H}$ is a linear hypergraph consisting of $n$ edges of…

2016

A linear hypergraph is intersecting if any two different edges have exactly one common vertex and an $n$-quasicluster is an…

2015

A decomposition of a simple graph $G$ is a pair $(G,D)$ where $D$ is a set of subgraphs of $G$, which partitions the edges of $G…

2012

Translate the graph into sets by using the shared vertexes as indexes. Then consider several different cases to see how the…

2010

Lovász [8] conjectured that for any natural number k, there exists a least natural number f(k) such that, for any two vertices s…

2010

2008

In this paper we prove the Lovász Conjecture: If Hom (C2r+1, H) is k-connected, then χ(H) ≥ k + 4, where H is a finite undirected…

2007

2005

To any two graphs G and H one can associate a cell complex Hom (G, H) by taking all graph multihomorphisms from G to H as cells…