D. Carter

collaborators

Showing math.COShow all

4 papers · 1 filter

math.CO2026

Hadwiger's Conjecture for ${co-claw, co-gem}$ -free graphs and ${fork, antifork}$ -free graphs

Daniel Carter, Jung Hon Yip

We prove Hadwiger's Conjecture for ${co-claw, co-gem}$ -free graphs and ${fork, antifork}$ -free graphs, where the co-claw is the disjoint union of a…

math.CO2026

When all directed cycles have the same weight

Eli Berger, Daniel Carter, Paul Seymour

A digraph $G$ is weightable if its edges can be weighted with real numbers such that the total weight in each directed cycle equals 1. There are several equivalent conditions: that…

math.CO2025

Pathographs and some (un)decidability results

Daniel Carter, Nicolas Trotignon

We introduce pathographs as a framework to study graph classes defined by forbidden structures, including forbidding induced subgraphs, minors, etc. Pathographs approximately gener…

math.CO2024

On the joint embedding property for cographs and trees

Daniel Carter

A family of graphs $F$ is said to have the joint embedding property (JEP) if for every $G_{1}, G_{2} \in F$ , there is an $H \in F$ that contains both $G_{1}$ …

Hadwiger's Conjecture for {co-claw,co-gem}-free graphs and {fork,antifork}-free graphs

When all directed cycles have the same weight

Pathographs and some (un)decidability results

On the joint embedding property for cographs and trees

Hadwiger's Conjecture for ${co-claw, co-gem}$ -free graphs and ${fork, antifork}$ -free graphs