Journal of Combinatorial Theory
- Journal of Combinatorial Theory
The "Journal of Combinatorial Theory", Series A [ [http://www.elsevier.com/wps/find/journaldescription.cws_home/622862/description Journal of Combinatorial Theory, Series A - Elsevier ] ] and Series B [ [http://www.elsevier.com/wps/find/journaldescription.cws_home/622863/description Journal of Combinatorial Theory, Series B - Elsevier ] ] , are mathematical journals specializing in combinatorics and related areas. They are published by Elsevier. Series A is concerned primarily with structures, designs, and applications of combinatorics. Series B is concerned primarily with graph theory and matroid theory.
The journal was founded by Frank Harary.[ [http://sigact.acm.org/harary.htm Frank Harary] , a biographical sketch at the ACM SIGACT site] ]References
Wikimedia Foundation.
2010.
Look at other dictionaries:
Journal of Combinatorial Theory — Le Journal of Combinatorial Theory, Series A[1] et Series B[2] est une revue mathématique se spécialisant en analyse combinatoire et autres questions associées ; elle est publiée par Elsevier Science. Series A est principalement consacrée… … Wikipédia en Français
Journal of Physical and Chemical Reference Data — Titre abrégé J. Phys. Chem. Ref. Data Discipline Chimie physique … Wikipédia en Français
Combinatorial optimization — In applied mathematics and theoretical computer science, combinatorial optimization is a topic that consists of finding an optimal object from a finite set of objects.[1] In many such problems, exhaustive search is not feasible. It operates on… … Wikipedia
Minor (graph theory) — In graph theory, an undirected graph H is called a minor of the graph G if H is isomorphic to a graph that can be obtained by zero or more edge contractions on a subgraph of G. The theory of graph minors began with Wagner s theorem that a graph… … Wikipedia
Hadwiger conjecture (graph theory) — In graph theory, the Hadwiger conjecture (or Hadwiger s conjecture) states that, if an undirected graph G requires k or more colors in any vertex coloring, then one can find k disjoint connected subgraphs of G such that each subgraph is connected … Wikipedia
Graph theory — In mathematics and computer science, graph theory is the study of graphs : mathematical structures used to model pairwise relations between objects from a certain collection. A graph in this context refers to a collection of vertices or nodes and … Wikipedia
De Bruijn–Erdős theorem (graph theory) — This article is about coloring infinite graphs. For the number of lines determined by a finite set of points, see De Bruijn–Erdős theorem (incidence geometry). In graph theory, the De Bruijn–Erdős theorem, proved by Nicolaas Govert de Bruijn and… … Wikipedia
Degeneracy (graph theory) — In graph theory, a k degenerate graph is an undirected graph in which every subgraph has a vertex of degree at most k: that is, some vertex in the subgraph touches k or fewer of the subgraph s edges. The degeneracy of a graph is the smallest… … Wikipedia
Tournament (graph theory) — Tournament A tournament on 4 vertices Vertices n Edges … Wikipedia
Crossing number (graph theory) — A drawing of the Heawood graph with three crossings. This is the minimum number of crossings among all drawings of this graph, so the graph has crossing number cr(G) = 3. In graph theory, the crossing number cr(G) of a graph G is the… … Wikipedia
