Results 221 to 230 of about 142,607 (267)
Some of the next articles are maybe not open access.
Oberwolfach Reports, 2005
This conference was one of a series of Oberwolfach conferences, held every two years or so, with focus on graph structure, decomposition, and representation. There were 49 participants, including over a dozen graduate students and postdocs. At the request of the Oberwolfach Director, the conference schedule was designed to promote ...
Reinhard Diestel +2 more
openaire +2 more sources
This conference was one of a series of Oberwolfach conferences, held every two years or so, with focus on graph structure, decomposition, and representation. There were 49 participants, including over a dozen graduate students and postdocs. At the request of the Oberwolfach Director, the conference schedule was designed to promote ...
Reinhard Diestel +2 more
openaire +2 more sources
Journal of the London Mathematical Society, 1998
This paper develops a deformation theory for \(k\)-parameter families of pointed marked graphs with fixed fundamental group \(F_n\). Applications include a simple geometric proof of stability of the rational homology of \(\Aut(F_n)\), computations of the rational homology of \(\Aut(F_n)\) in small dimensions, proofs that various natural complexes of ...
Hatcher, Allen, Vogtmann, Karen
openaire +2 more sources
This paper develops a deformation theory for \(k\)-parameter families of pointed marked graphs with fixed fundamental group \(F_n\). Applications include a simple geometric proof of stability of the rational homology of \(\Aut(F_n)\), computations of the rational homology of \(\Aut(F_n)\) in small dimensions, proofs that various natural complexes of ...
Hatcher, Allen, Vogtmann, Karen
openaire +2 more sources
Mediterranean Journal of Mathematics, 2013
The authors define ``graphical'' homology groups for reflexive nonoriented graphs. If \(G\) is such a graph, these homology groups result from a chain complex based on \textit{singular \(n\)-simplices} defined as graph homomorphisms \(\overline{2}^n \to G\) where \(\overline{2}\) is the looped path with three vertices and \(\overline{2}^n\) is the ...
Talbi, Mohamed Elamine, Benayat, Djilali
openaire +2 more sources
The authors define ``graphical'' homology groups for reflexive nonoriented graphs. If \(G\) is such a graph, these homology groups result from a chain complex based on \textit{singular \(n\)-simplices} defined as graph homomorphisms \(\overline{2}^n \to G\) where \(\overline{2}\) is the looped path with three vertices and \(\overline{2}^n\) is the ...
Talbi, Mohamed Elamine, Benayat, Djilali
openaire +2 more sources
2013
This chapter on chemical graph theory forms part of the natural science and processes section of the ...
Estrada, Ernesto, Bonchev, Danail
openaire +2 more sources
This chapter on chemical graph theory forms part of the natural science and processes section of the ...
Estrada, Ernesto, Bonchev, Danail
openaire +2 more sources
The Mathematical Gazette, 1963
Suppose there are n towns every pair of which are connected by a single one-way road (roads meet only at towns). Is it possible to choose the direction of the traffic on all the roads so that if any two towns are named there is always a third from which the two named can be reached directly ...
openaire +1 more source
Suppose there are n towns every pair of which are connected by a single one-way road (roads meet only at towns). Is it possible to choose the direction of the traffic on all the roads so that if any two towns are named there is always a third from which the two named can be reached directly ...
openaire +1 more source
Cabri-graph, a sketchpad for graph theory
Mathematics and Computers in Simulation, 1996zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Baudon, Olivier, Laborde, Jean-Marie
openaire +2 more sources
Canadian Journal of Mathematics, 1959
A well-known theorem of Ramsay (8; 9) states that to every n there exists a smallest integer g(n) so that every graph of g(n) vertices contains either a set of n independent points or a complete graph of order n, but there exists a graph of g(n) — 1 vertices which does not contain a complete subgraph of n vertices and also does not contain a set of n ...
openaire +1 more source
A well-known theorem of Ramsay (8; 9) states that to every n there exists a smallest integer g(n) so that every graph of g(n) vertices contains either a set of n independent points or a complete graph of order n, but there exists a graph of g(n) — 1 vertices which does not contain a complete subgraph of n vertices and also does not contain a set of n ...
openaire +1 more source
Annals of Operations Research, 1993
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
openaire +2 more sources
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
openaire +2 more sources
2019
Graphs are a mathematical structure composed of a set of elements, and a set of connection between them. Due to their intuitive representation, graphs are widely employed in many different fields and, in particular, in systems biology and bioinformatics.
Beretta S., Denti L., Previtali M.
openaire +1 more source
Graphs are a mathematical structure composed of a set of elements, and a set of connection between them. Due to their intuitive representation, graphs are widely employed in many different fields and, in particular, in systems biology and bioinformatics.
Beretta S., Denti L., Previtali M.
openaire +1 more source
Mathematical Proceedings of the Cambridge Philosophical Society, 1947
We call a point set in a complex K a 0-cell if it contains just one point of K, and a 1-cell if it is an open arc. A set L of 0-cells and 1-cells of K is called a linear graph on K if(i) no two members of L intersect,(ii) the union of all the members of L is K,(iii) each end-point of a 1-cell of L is a 0-cell of Land (iv) the number of 0-cells and 1 ...
openaire +2 more sources
We call a point set in a complex K a 0-cell if it contains just one point of K, and a 1-cell if it is an open arc. A set L of 0-cells and 1-cells of K is called a linear graph on K if(i) no two members of L intersect,(ii) the union of all the members of L is K,(iii) each end-point of a 1-cell of L is a 0-cell of Land (iv) the number of 0-cells and 1 ...
openaire +2 more sources