The following pages link to Gregory J. Puleo (Q497322):
Displaying 38 items.
- Sum-paintability of generalized theta-graphs (Q497323) (← links)
- Maximal \(k\)-edge-colorable subgraphs, Vizing's theorem, and Tuza's conjecture (Q526243) (← links)
- Environmental evolutionary graph theory (Q739678) (← links)
- Maximizing the number of edges in optimal \(k\)-rankings (Q896093) (← links)
- List-edge-colouring planar graphs with precoloured edges (Q1621065) (← links)
- On the chromatic numbers of rational spaces (Q1646347) (← links)
- Extension from precoloured sets of edges (Q1658745) (← links)
- The list chromatic index of simple graphs whose odd cycles intersect in at most one edge (Q1690237) (← links)
- Online sum-paintability: the slow-coloring game (Q1699554) (← links)
- Homotopy type of the neighborhood complexes of graphs of maximal degree at most 3 and 4-regular circulant graphs (Q1740361) (← links)
- The game coloring number of planar graphs with a specific girth (Q1743687) (← links)
- Paired threshold graphs (Q1801073) (← links)
- Revolutionaries and spies: spy-good and spy-bad graphs (Q1929215) (← links)
- A lower bound on the saturation number, and graphs for which it is sharp (Q2138956) (← links)
- Some results on multithreshold graphs (Q2175817) (← links)
- Packing and covering directed triangles (Q2191263) (← links)
- On the triangle clique cover and \(K_t\) clique cover problems (Q2279271) (← links)
- extremal aspects of the Erdős-Gallai-Tuza conjecture (Q2342626) (← links)
- Tuza's conjecture for graphs with maximum average degree less than 7 (Q2349964) (← links)
- Chain-making games in grid-like posets (Q2375851) (← links)
- Upper bounds of proper connection number of graphs (Q2410035) (← links)
- Computing similarity distances between rankings (Q2410235) (← links)
- Graphs with \(\alpha _1\) and \(\tau _1\) both large (Q2413631) (← links)
- Online sum-paintability: slow-coloring of trees (Q2416431) (← links)
- Three topics in online list coloring (Q2448254) (← links)
- Complexity of a disjoint matching problem on bipartite graphs (Q2629777) (← links)
- Correlation Clustering with Constrained Cluster Sizes and Extended Weights Bounds (Q2947231) (← links)
- On a Conjecture of Erdős, Gallai, and Tuza (Q2947853) (← links)
- Codes for DNA Sequence Profiles (Q2976761) (← links)
- Upper bounds for inverse domination in graphs (Q3380407) (← links)
- <i>t</i>‐Cores for (Δ+t)‐edge‐coloring (Q5066915) (← links)
- Motif and Hypergraph Correlation Clustering (Q5123914) (← links)
- On (4, 2)‐Choosable Graphs (Q5272926) (← links)
- Correlation Clustering and Biclustering With Locally Bounded Errors (Q5375565) (← links)
- (Q5413467) (← links)
- Pursuit evasion on polyhedral surfaces (Q5963379) (← links)
- Strong coloring 2‐regular graphs: Cycle restrictions and partial colorings (Q6081880) (← links)
- Proper rainbow-cycle-forbidding edge colorings of graphs (Q6644900) (← links)
