En aquest treball tractem el problema de descriure classes de grafs especificades per un menor prohibit. Concretament, presentem resultats de Wagner que caracteritzen grafs sense K5 o bé K3,3 com a menor. També donem caracteritzacions de grafs que no contenen la roda W4 amb 4 vèrtexs a la circumferència; el graf complet amb 5 vèrtexs sense una aresta; el prisme triangular; i la roda W5 amb 5 vèrtexs a la circumferència. Com a una de les eines utilitzem el teorema de Tutte de les rodes, del qual també donem una prova. La majoria dels resultats és àmpliament coneguda, però les demostracions no són disponibles fàcilment. Són complicades de trobar, incòmodes de llegir i usen terminologia obsoleta. La contribució principal d'aquest treball és r...
Abstract. We introduce a notion of bipartite minors and prove a bipartite analog of Wagner’s theorem...
We study a new geometric graph parameter $egd(G)$, defined as the smallest integer $r\ge 1$ for whic...
For a given simple graph G, is defined to be the set of real symmetric matrices A whose (i,j)th entr...
En aquest treball tractem el problema de descriure classes de grafs especificades per un menor prohi...
Celem pracy jest scharakteryzowanie klas grafów, które można zdefiniować za pomocą małych struktur z...
AbstractFor a given simple graph G, S(G) is defined to be the set of real symmetric matrices A whose...
Si pregunteu a un expert quin és el resultat estrella de la combinatòria de les últimes dècades, és ...
International audienceLet $W_t$ denote the wheel on t+1 vertices. We prove that for every integer $t...
AbstractForbidden minors and subdivisions for toroidal graphs are numerous. We consider the toroidal...
AbstractGraphs distinguished by Kr-minor prohibition limited to subgraphs induced by circuits have c...
This dissertation solves two problems relating to the structure of graphs. The first of these is mot...
For many classes of combinatorial structures, such as graphs and matroids, there exists a concept of...
The Gram dimension gd(G) of a graph G is the smallest inte- ger k ≥ 1 such that any partial real sym...
AbstractA k-tree is formed from a k-complete graph by recursively adding a vertex adjacent to all ve...
Let $G$ be a graph and $p \in [1, \infty]$. The parameter $f_p(G)$ is the least integer $k$ such tha...
Abstract. We introduce a notion of bipartite minors and prove a bipartite analog of Wagner’s theorem...
We study a new geometric graph parameter $egd(G)$, defined as the smallest integer $r\ge 1$ for whic...
For a given simple graph G, is defined to be the set of real symmetric matrices A whose (i,j)th entr...
En aquest treball tractem el problema de descriure classes de grafs especificades per un menor prohi...
Celem pracy jest scharakteryzowanie klas grafów, które można zdefiniować za pomocą małych struktur z...
AbstractFor a given simple graph G, S(G) is defined to be the set of real symmetric matrices A whose...
Si pregunteu a un expert quin és el resultat estrella de la combinatòria de les últimes dècades, és ...
International audienceLet $W_t$ denote the wheel on t+1 vertices. We prove that for every integer $t...
AbstractForbidden minors and subdivisions for toroidal graphs are numerous. We consider the toroidal...
AbstractGraphs distinguished by Kr-minor prohibition limited to subgraphs induced by circuits have c...
This dissertation solves two problems relating to the structure of graphs. The first of these is mot...
For many classes of combinatorial structures, such as graphs and matroids, there exists a concept of...
The Gram dimension gd(G) of a graph G is the smallest inte- ger k ≥ 1 such that any partial real sym...
AbstractA k-tree is formed from a k-complete graph by recursively adding a vertex adjacent to all ve...
Let $G$ be a graph and $p \in [1, \infty]$. The parameter $f_p(G)$ is the least integer $k$ such tha...
Abstract. We introduce a notion of bipartite minors and prove a bipartite analog of Wagner’s theorem...
We study a new geometric graph parameter $egd(G)$, defined as the smallest integer $r\ge 1$ for whic...
For a given simple graph G, is defined to be the set of real symmetric matrices A whose (i,j)th entr...