Indonesian Combinatorial Society (InaCombS)
Learned society in Bandung, Indonesia
Mathematics Departement, Faculty of Mathematics and Natural Sciences, Universitas Indonesia, Depok, Jawa Barat 16424, Indonesia
Indonesian Combinatorial Society (InaCombS)
Indonesian Combinatorial Society (InaCombS) was established on 6 May 2006 to facilitate, encourage, foster and cherish combinatorics development in Indonesia and improve the application of combinatorics to other disciplines.
InaCombS is a professional organization that is scientific, non-profit and independent. The organization is a forum for combinatorists and other enthusiasts who want to develop combinatorics in Indonesia. InaCombS is headquartered in Bandung, West Java.
InaCombS is a professional organization that is scientific, non-profit and independent. The organization is a forum for combinatorists and other enthusiasts who want to develop combinatorics in Indonesia. InaCombS is headquartered in Bandung, West Java.
Fields of study: Mathematics & Statistics
Journals published by InaCombS:
Catalogue
101–114 of 114 results.
-
• 2014
English
In this paper, we define and compare three new measures of graph irregularity. We use these measures to tighten upper bounds for the chromatic number and the Colin de Verdiere parameter. We also stren... -
Algebraic and Computer-based Methods in the Undirected Degree/diameter Problem - a Brief Survey Download• 2014
English
This paper discusses the most popular algebraic techniques and computational methods that have been used to construct large graphs with given degree and diameter.
-
• 2013
English
Given a subset C in a metric space E, its successor is the subset s(C) of points at maximum distance from C in E. We study some properties of the sequence obtained by iterating this operation. Graph...
-
• 2013
English
The paper deals with the problem of labeling the vertices and edges of a plane graph in such a way that the labels of the vertices and edges surrounding that face add up to a weight of that face. A la...
-
• 2013
English
This article gives a survey of all results on the power graphs of groups and semigroups obtained in the literature. Various conjectures due to other authors, questions and open problems are also inclu...
-
• 2013
English
This is a survey of results obtained during the last 45 years regarding the intersection behaviour of all longest paths, or all longest cycles, in connected graphs. Planar graphs and graphs of higher ...
-
• 2013
English
A block-chain is a graph whose block graph is a path, i.e. it is either a $P_1$, a $P_2$, or a 2-connected graph, or a graph of connectivity 1 with exactly two end-blocks. A graph is called traceable ...
-
• 2013
English
For a given finite poset $P$, $La(n,P)$ denotes the largest size of a family $\mathcal{F}$ of subsets of $[n]$ not containing $P$ as a weak subposet. We exactly determine $La(n,P)$ for infinitely many...
-
• 2013
English
The Ramsey number R(m, n) is the smallest integer p such that any blue-red colouring of the edges of the complete graph Kp forces the appearance of a blue Km or a red Kn. Bipartite Ramsey problems dea...
-
• 2013
English
We study the main properties of a new product of bipartite digraphs which we call Manhattan product. This product allows us to understand the subjacent product in the Manhattan street networks and can...
-
• 2013
English
The H-force number of a hamiltonian graph G is the smallest number k with the property that there exists a set W ⊆ V (G) with |W| = k such that each cycle passing through all vertices of W is a hamilt...
-
• 2013
English
Let $c$ be a proper $k$-coloring of a connected graph $G$. Let $\Pi = \{S_{1}, S_{2},\ldots, S_{k}\}$ be the induced partition of $V(G)$ by $c$, where $S_{i}$ is the partition class having all vert...
-
• 2013
English
We investigate the vertex total and edge total modication of the well-known irregularity strength of graphs. We have determined the exact values of the total vertex irregularity strength and the total...
-
• 2013
English
In this paper, we obtain a sufficient condition for the existence of parity factors in a regular graph in terms of edge-connectivity. Moreover, we also show that our condition is sharp.