All

What are you looking for?

All
Projects
Results
Organizations

Quick search

  • Projects supported by TA ČR
  • Excellent projects
  • Projects with the highest public support
  • Current projects

Smart search

  • That is how I find a specific +word
  • That is how I leave the -word out of the results
  • “That is how I can find the whole phrase”
EN
ČeštinaEnglish

Filters

7 386 (0,204s) •

Result

Efficient generation of elimination trees and graph associahedra

produces a Hamilton cycle on the graph associahedron of G, rather than just Hamilton characterizes chordality, i.e., it computes a Hamilton path on the graph associahedron of GAn elimination tree for a connected <...

Computer sciences, information science, bioinformathics (hardware development to be 2.2, social aspect to be 5.8)

  • 2022
    • •
  • D
    • •
  • Link
Result

Simplex, associahedron and cyclohedron.

Original scientific paper dealing with Simplex, associahedron and cyclohedron.

BA - Obecná matematika

  • 1998
    • •
  • D
Result

Flips in Colorful Triangulations

The associahedron is the graph G_N that has as nodes all triangulations of a convex N-gon, and an edge between any two triangulations that differ in a flip operation. A flip removes an edge shared by two triangles and replaces it by...

Computer sciences, information science, bioinformathics (hardware development to be 2.2, social aspect to be 5.8)

  • 2024
    • •
  • D
    • •
  • Link
Result

Bipermutahedron and biassociahedron

We give a simple description of the face poset of a version of the biassociahedra that generalizes, in a straightforward manner, the description of the faces of the Stasheff?s associahedra via planar trees. We believe that our description will substa...

BA - Obecná matematika

  • 2015
    • •
  • Jx
    • •
  • Link
Result

Permutads via operadic categories, and the hidden associahedron

The present article exploits the fact that permutads (aka shuffle algebras) are algebras over a terminal operad in a certain operadic category Per. In the first, classical part we formulate and prove a claim envisaged by Loday and Ronco that the cell...

Pure mathematics

  • 2020
    • •
  • Jimp
    • •
  • Link
Result

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
    • •
  • Link
Result

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
Result

Note on enumeration of labeled split graphs

Main topics of the document: graph enumeration; labeled graph; split graph...

BA - Obecná matematika

  • 2015
    • •
  • Jx
    • •
  • Link
Result

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
Result

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
    • •
  • Link
  • 1 - 10 out of 7 386