Filters
Ordinary graphs and subplane partitions
Ordinary graphs and subplane partitions...
BA - Obecná matematika
- 2004 •
- Jx
Rok uplatnění
Jx - Nezařazeno - Článek v odborném periodiku (Jimp, Jsc a Jost)
Graphs with a path partition for structuring the digital plane
We introduce the concept of graphs with a path partition and define a special type of connectedness in these graphs. The connectedness is shown to have certain properties suitable for using graphs with a path p...
IN - Informatika
- 2013 •
- Jx
Rok uplatnění
Jx - Nezařazeno - Článek v odborném periodiku (Jimp, Jsc a Jost)
Zou, Hui Wen: The chromatic uniqueness of certain complete t-partite graphs.
Zou, Hui Wen: The chromatic uniqueness of certain complete t-partite graphs.
BA - Obecná matematika
- 2004 •
- Jx
Rok uplatnění
Jx - Nezařazeno - Článek v odborném periodiku (Jimp, Jsc a Jost)
Partitioning graphs into induced subgraphs
We study the Partition into H problem from the parameterized complexity point of view. In the Partition into H problem the task is to partition the vertices of a graph G into sets V_1,...,V_r such that the grap...
Computer sciences, information science, bioinformathics (hardware development to be 2.2, social aspect to be 5.8)
- 2020 •
- Jimp •
- Link
Rok uplatnění
Jimp - Článek v periodiku v databázi Web of Science
Výsledek na webu
Graph partitions with prescribed patterns
We discuss partition problems that generalize graph colouring and homomorphism problems, and occur frequently in the study of perfect graphs. Depending on the pattern, we seek a finite forbidden induced subgraph characteriz...
BA - Obecná matematika
- 2014 •
- Jx •
- Link
Rok uplatnění
Jx - Nezařazeno - Článek v odborném periodiku (Jimp, Jsc a Jost)
Výsledek na webu
The Comparison of Graph Partitioning Methods on Interlocking Directorates Network in Two-tier Corporate Governance System
Main topics of the document: corporate governance; interlocking directorates; network theory; graph partitioning; Two-tier system...
AE - Řízení, správa a administrativa
- 2013 •
- D
Rok uplatnění
D - Stať ve sborníku
Locally constrained graph homomorphisms and equitable partitions
The paper explores relations between structure of equitable partitions and the existence of a locally constrained homomorphisms. Several results on computational complexity are obtained....
BA - Obecná matematika
- 2008 •
- Jx
Rok uplatnění
Jx - Nezařazeno - Článek v odborném periodiku (Jimp, Jsc a Jost)
Belief Propagation for Graph Partitioning
We study the belief-propagation algorithm for the graph bi-partitioning problem, i.e. the ground state of the ferromagnetic Ising model at a fixed magnetization-partitioning problem on random graphs, as well as an ...
BE - Teoretická fyzika
- 2010 •
- Jx
Rok uplatnění
Jx - Nezařazeno - Článek v odborném periodiku (Jimp, Jsc a Jost)
On the optimality of the Arf invariant formula for graph polynomials
We prove optimality of the Arf invariant formula for the generating function of even subgraphs, or, equivalently, the Ising partition function, of a graph. It is shown that the Ising partition function has an exponential ad...
BA - Obecná matematika
- 2011 •
- Jx •
- Link
Rok uplatnění
Jx - Nezařazeno - Článek v odborném periodiku (Jimp, Jsc a Jost)
Výsledek na webu
Halving complete 4-partie graphs
The spectrum of complete 4-partite graphs with at most one odd part which 4-partite graphs with all parts odd the spectrum problem for factors, 3, 4, partial results are presented, focusing on decompositions of
BA - Obecná matematika
- 2000 •
- Jx
Rok uplatnění
Jx - Nezařazeno - Článek v odborném periodiku (Jimp, Jsc a Jost)
- 1 - 10 out of 10 008