Search Results - "Jelić Milutinović, Marija"

Perfect Matching Complexes of Honeycomb Graphs by Bayer, Margaret, Jelić Milutinović, Marija, Vega, Julianne

“…The perfect matching complex of a graph is the simplicial complex on the edge set of the graph with facets corresponding to perfect matchings of the graph…”
Get full text

Matching Complexes of Trees and Applications of the Matching Tree Algorithm by Jelić Milutinović, Marija, Jenne, Helen, McDonough, Alex, Vega, Julianne

“…A matching complex of a simple graph G is a simplicial complex with faces given by the matchings of G . The topology of matching complexes is mysterious; there…”
Get full text

General polygonal line tilings and their matching complexes by Bayer, Margaret, Jelić Milutinović, Marija, Vega, Julianne

“…A (general) polygonal line tiling is a graph formed by a string of cycles, each intersecting the previous at an edge, no three intersecting. In 2022,…”
Get full text

Total Cut Complexes of Graphs by Bayer, Margaret, Denker, Mark, Milutinović, Marija Jelić, Rowlands, Rowan, Sundaram, Sheila, Xue, Lei

Get full text

MANIFOLD MATCHING COMPLEXES by Bayer, Margaret, Goeckner, Bennet, Jelić Milutinović, Marija

“…The matching complex of a graph is the simplicial complex whose vertex set is the set of edges of the graph with a face for each independent set of edges. In…”
Get full text

Bounding the tripartite‐circle crossing number of complete tripartite graphs by Camacho, Charles, Fernández‐Merchant, Silvia, Jelić Milutinović, Marija, Kirsch, Rachel, Kleist, Linda, Matson, Elizabeth B., White, Jennifer

“…A tripartite‐circle drawing of a tripartite graph is a drawing in the plane, where each part of a vertex partition is placed on one of three disjoint circles,…”
Get full text

Matching Complexes of Outerplanar Graphs by Bayer, Margaret, Milutinović, Marija Jelić, Vega, Julianne

“…An outerplanar graph is a planar graph that has a planar drawing with all vertices on the unbounded face. The matching complex of a graph is the simplicial…”
Get full text

General polygonal line tilings and their matching complexes by Bayer, Margaret, Milutinović, Marija Jelić, Vega, Julianne

“…A (general) polygonal line tiling is a graph formed by a string of cycles, each intersecting the previous at an edge, no three intersecting. In 2022,…”
Get full text

Perfect Matching Complexes of Honeycomb Graphs by Bayer, Margaret, Milutinović, Marija Jelić, Vega, Julianne

“…The {\em perfect matching complex} of a graph is the simplicial complex on the edge set of the graph with facets corresponding to perfect matchings of the…”
Get full text

Topology of Cut Complexes II by Bayer, Margaret, Denker, Mark, Milutinović, Marija Jelić, Sundaram, Sheila, Xue, Lei

“…We continue the study of the $k$-cut complex $\Delta_k(G)$ of a graph $G$ initiated in the paper of Bayer, Denker, Jeli\'c Milutinovi\'c, Rowlands, Sundaram…”
Get full text

Topology of Cut Complexes of Graphs by Bayer, Margaret, Denker, Mark, Milutinović, Marija Jelić, Rowlands, Rowan, Sundaram, Sheila, Xue, Lei

“…SIAM J. on Discrete Mathematics,Vol. 38 (2), 1630--1675 (2024) We define the $k$-cut complex of a graph $G$ with vertex set $V(G)$ to be the simplicial complex…”
Get full text

Manifold Matching Complexes by Bayer, Margaret, Goeckner, Bennet, Milutinović, Marija Jelić

“…The matching complex of a graph is the simplicial complex whose vertex set is the set of edges of the graph with a face for each independent set of edges. In…”
Get full text

Total Cut Complexes of Graphs by Bayer, Margaret, Denker, Mark, Milutinović, Marija Jelić, Rowlands, Rowan, Sundaram, Sheila, Xue, Lei

“…Inspired by work of Fr\"oberg (1990), and Eagon and Reiner (1998), we define the \emph{total $k$-cut complex} of a graph $G$ to be the simplicial complex whose…”
Get full text

Bounding the tripartite-circle crossing number of complete tripartite graphs by Camacho, Charles, Fernández-Merchant, Silvia, Milutinović, Marija Jelić, Kirsch, Rachel, Kleist, Linda, Matson, Elizabeth Bailey, White, Jennifer

“…J. Graph Theory. 2022; 100: 5-27 A tripartite-circle drawing of a tripartite graph is a drawing in the plane, where each part of a vertex partition is placed…”
Get full text

The tripartite-circle crossing number of graphs with two small partition classes by Camacho, Charles, Fernández-Merchant, Silvia, Milutinović, Marija Jelić, Kirsch, Rachel, Kleist, Linda, Matson, Elizabeth Bailey, White, Jennifer

“…Computing in Geometry and Topology, Vol. 3 No. 1 (2024), 9:1-9:21 A tripartite-circle drawing of a tripartite graph is a drawing in the plane, where each part…”
Get full text

Matching complexes of trees and applications of the matching tree algorithm by Milutinović, Marija Jelić, Jenne, Helen, McDonough, Alex, Vega, Julianne

“…A matching complex of a simple graph $G$ is a simplicial complex with faces given by the matchings of $G$. The topology of matching complexes is mysterious;…”
Get full text

Combinatorics of `unavoidable complexes by Milutinović, Marija Jelić, Jojić, Duško, Timotijević, Marinko, Vrećica, Siniša T, Živaljević, Rade T

“…The partition number $\pi(K)$ of a simplicial complex $K\subset 2^{[n]}$ is the minimum integer $\nu$ such that for each partition $A_1\uplus\ldots\uplus A_\nu…”
Get full text