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… (More)
Wikipedia

Topic mentions per year

Topic mentions per year

1990-2015
02419902015

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2015
2015
The Erdős-Faber-Lovász conjecture is the statement that every graph that is the union of n cliques of size n intersecting… (More)
Is this relevant?
2013
2013
The b-chromatic number χb(G) of a graph G is themaximum k for which there is a function c: V (G) → {1, 2, . . . , k} such that c… (More)
  • figure 1
  • figure 3
  • figure 4
  • table 1
Is this relevant?
2009
2009
A foundation is laid for a theory of combinatorial groupoids, allowing us to use concepts like “holonomy”, “parallel transport… (More)
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • table 1
Is this relevant?
2008
2008
The groupoid of projectivities, introduced by M. Joswig [17], serves as a basis for a construction of parallel transport of graph… (More)
  • table 1
  • figure 1
Is this relevant?
2008
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… (More)
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • table 1
Is this relevant?
2007
2007
A hypergraph H is linear if no two distinct edges of H intersect in more than one vertex and loopless if no edge has size one. A… (More)
Is this relevant?
2005
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… (More)
  • figure 3.1
  • figure 4.1
  • figure 4.2
  • figure 4.3
  • figure 4.4
Is this relevant?
2004
2004
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… (More)
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • table 1
Is this relevant?
2004
2004
The Erdős–Faber–Lovász conjecture states that if a graph G is the union of n cliques of size n no two of which share more than… (More)
Is this relevant?
1992
1992
Let H be any hypergraph in which any two edges have at most one vertex in common. We prove that one can assign non-negative real… (More)
Is this relevant?