Filtry
Inversion of e-simple Block Matrices
We recall previous results on inverting matrices the digraph of which is e-simple, i.e. such that every edge is contained in at most one simple cycle. We present and analyze a finite algorithm for the inversion. Applications to M-matrices are include...
BA - Obecná matematika
- 2005 •
- Jx
Rok uplatnění
Jx - Nezařazeno - Článek v odborném periodiku (Jimp, Jsc a Jost)
Which distance-hereditary graphs are cover?incomparability graphs?
In this paper we deal with cover?incomparability graphs of posets, or briefly C?I graphs. These are graphs derived from posets as the edge-union of their cover graph and their incomparability graph. We ans...
BA - Obecná matematika
- 2013 •
- Jx •
- Odkaz
Rok uplatnění
Jx - Nezařazeno - Článek v odborném periodiku (Jimp, Jsc a Jost)
Výsledek na webu
On graphs associated to posets, especially on cover-incomparability graphs
We deal with posets and graphs associated to them. There are several standard ways how to associate a graph to a poset. Depending on the edge-set we may obtain comparability graphs, incomparability graphs or cover ...
BA - Obecná matematika
- 2013 •
- D
Rok uplatnění
D - Stať ve sborníku
Note on enumeration of labeled split graphs
Main topics of the document: graph enumeration; labeled graph; split graph...
BA - Obecná matematika
- 2015 •
- Jx •
- Odkaz
Rok uplatnění
Jx - Nezařazeno - Článek v odborném periodiku (Jimp, Jsc a Jost)
Výsledek na webu
An Open Problem of Star-like Graph Enumeration
Main topics of the document: Labeled Graphs; Graph Enumeration; Star-like Graphs...
BA - Obecná matematika
- 2012 •
- D
Rok uplatnění
D - Stať ve sborníku
On cover-incomparability graphs
In this paper we deal with posets and graphs associated to them. We concentrate on so called cover-incomparability graphs. We prove that the C-I graph recognition problem is in general NP-complete. Then we present several c...
BA - Obecná matematika
- 2014 •
- D •
- Odkaz
Rok uplatnění
D - Stať ve sborníku
Výsledek na webu
On recognizing graphs by numbers of homomorphisms
Let hom (G, H) be the number of homomorphisms from a graph G to a graph H. A well-known result of Lovász states that the function hom (?, H) from all graphs uniquely determines the graph H up to isomorphism. We stu...
BA - Obecná matematika
- 2010 •
- Jx
Rok uplatnění
Jx - Nezařazeno - Článek v odborném periodiku (Jimp, Jsc a Jost)
Geometric Biplane Graphs II: Graph Augmentation
We study biplane graphs drawn on a finite point set S in the plane in general position. This is the family of geometric graphs whose vertex set is S and which can be decomposed into two plane graphs. We show that every suff...
BA - Obecná matematika
- 2015 •
- Jx •
- Odkaz
Rok uplatnění
Jx - Nezařazeno - Článek v odborném periodiku (Jimp, Jsc a Jost)
Výsledek na webu
Reconfiguration graph for vertex colourings of weakly chordal graphs
We show that for each k>=3 there is a k-colourable weakly chordal graph G such that the reconfiguration graph R_k+1(G) is disconnected. We also introduce a subclass of k-colourable weakly chordal graphs and show that the...
Pure mathematics
- 2019 •
- Jimp •
- Odkaz
Rok uplatnění
Jimp - Článek v periodiku v databázi Web of Science
Výsledek na webu
On the signed chromatic number of some classes of graphs
A signed graph (G, sigma) is a graph G along with a function sigma : E(G) -> {+, -}. A closed walk of a signed graph is positive (resp., negative) if it has an even (resp) signed graph to another signed grap...
Computer sciences, information science, bioinformathics (hardware development to be 2.2, social aspect to be 5.8)
- 2022 •
- Jimp •
- Odkaz
Rok uplatnění
Jimp - Článek v periodiku v databázi Web of Science
Výsledek na webu
- 1 - 10 z 7 762