{
  "$type": "site.standard.document",
  "bskyPostRef": {
    "cid": "bafyreihtelln5hydeoowzeaiw3osf6hnssdoldk5hvi3ekhpaejppvjfuq",
    "uri": "at://did:plc:4rgrdigiftglskeax4wvmsev/app.bsky.feed.post/3mjqijm4wu5a2"
  },
  "coverImage": {
    "$type": "blob",
    "ref": {
      "$link": "bafkreiflo6xt7is6b2iafwghkjahlgggocme5jwjsbeuqqwcywuvjhmszm"
    },
    "mimeType": "image/png",
    "size": 24783
  },
  "path": "/abs/2604.15274v1",
  "publishedAt": "2026-04-17T00:00:00.000Z",
  "site": "https://arxiv.org",
  "tags": [
    "Antonio Lauerbach",
    "Konstanty Junosza-Szaniawski",
    "Marie Diana Sieper",
    "Alexander Wolff"
  ],
  "textContent": "**Authors:** Antonio Lauerbach, Konstanty Junosza-Szaniawski, Marie Diana Sieper, Alexander Wolff\n\nA mixed graph contains (undirected) edges as well as (directed) arcs, thus generalizing undirected and directed graphs. A proper coloring c of a mixed graph G assigns a positive integer to each vertex such that c(u)!=c(v) for every edge {u,v} and c(u)",
  "title": "The Parameterized Complexity of Coloring Mixed Graphs"
}