20 results for “Background in category theory and graph theory”
CS papers onlyHybrid search: Keyword + semantic, ranked by combined score.ⓘ
Want pure semantic search? Try claim verification →
This paper introduces a new way to represent finite posets as subwords of finite words in categories, and characterizes the monic categories that admit this representation.
The paper shows that an oddomorphism between graphs does not imply graph minor containment and introduces a new structural relation called split-off minor.
This paper studies the structural expressivity and parameterized complexity of counting homomorphisms from small temporal patterns to large temporal graphs, proving a temporal Lovász-style theorem, in…
The paper shows that every problem asking if a given graph has an edge-coloring without an edge-colored clique from a fixed family is poly-time equivalent to a Constraint Satisfaction Problem, resulti…
A new polynomial-time algorithm is presented for optimally coloring perfect graphs using graph-theoretic operations and iterative walk counting.
This paper shows #P-completeness for several graph counting problems using a new technique.
This paper proves that counting quasi-trees in a connected ribbon graph is #P-complete.
Sarosh Adenwalla, Samuel Braunfeld, Tomáš Hons, John Sylvester +1 more
This paper studies set-defined graph classes and proves that bounded unions of shift-colorable graphs form the fundamental obstruction to chromatic number boundness in these classes.
The paper presents a novel and significantly faster algorithm for computing the second discrete homology group of a graph by identifying five basic quotient shapes of the 3-cube.
The paper resolves three conjectures related to arrow pattern avoidance in permutations using two different proof methods.
Ramos and White's theorem on multiplicity stability of rational homology for configuration spaces of certain graphs is extended and computed for various families of graphs using computer algebra.
This paper characterizes acyclic hypergraphs according to whether they admit unique canonical join trees as root and provides a linear-time algorithm to construct them.
This paper presents methods for ranking and unranking permutations avoiding a pattern of length three in lexicographic or colexicographic order.
This paper studies the NP-completeness and provides a polynomial-time algorithm for the disjoint separators problem in planar graphs when all sizes are equal to one.