The following pages link to Nathann Cohen (Q484320):
Displaying 43 items.
- On the proper orientation number of bipartite graphs (Q484321) (← links)
- Tradeoffs in process strategy games with application in the WDM reconfiguration problem (Q638539) (← links)
- Linear and 2-frugal choosability of graphs of small maximum average degree (Q659749) (← links)
- Planar graphs with maximum degree \(\Delta \geq 9\) are \((\Delta +1)\)-edge-choosable--a short proof (Q710613) (← links)
- Equitable orientations of sparse uniform hypergraphs (Q727210) (← links)
- Not all partial cubes are \(\Theta \)-graceful (Q785832) (← links)
- Safe sets in graphs: graph classes and structural parameters (Q1631677) (← links)
- Bispindles in strongly connected digraphs with large chromatic number (Q1640212) (← links)
- Complexity dichotomies for the minimum \(\mathcal{F}\)-overlay problem (Q1642689) (← links)
- Complexity dichotomies for the \textsc{Minimum} \(\mathcal{F}\)-\textsc{Overlay} problem (Q1711667) (← links)
- Spy-game on graphs: complexity and simple topologies (Q1748987) (← links)
- On the minimum size of an identifying code over all orientations of a graph (Q1753015) (← links)
- Study of a combinatorial game in graphs through linear programming (Q1986957) (← links)
- Subdivisions in digraphs of large out-degree or large dichromatic number (Q2315440) (← links)
- From edge-coloring to strong edge-coloring (Q2341055) (← links)
- Implementing Brouwer's database of strongly regular graphs (Q2364640) (← links)
- Applying clique-decomposition for computing Gromov hyperbolicity (Q2399620) (← links)
- A polynomial-time algorithm for outerplanar diameter improvement (Q2402366) (← links)
- Bispindle in strongly connected digraphs with large chromatic number (Q2413152) (← links)
- Finding good 2-partitions of digraphs. II. Enumerable properties (Q2629228) (← links)
- A Doubling Construction for 3-Uniform Friendship Hypergraphs with the Universal Pairs Property (Q2816380) (← links)
- (Q2816516) (← links)
- On Computing the Gromov Hyperbolicity (Q2828207) (← links)
- Acyclic edge-colouring of planar graphs. Extended abstract (Q2851497) (← links)
- A note on Zagreb indices inequality for trees and unicyclic graphs (Q2892009) (← links)
- Induced Decompositions of Highly Dense Graphs (Q2940990) (← links)
- Safe Sets in Graphs: Graph Classes and Structural Parameters (Q2958317) (← links)
- Bin Packing with Colocations (Q2971155) (← links)
- Graphs with maximal irregularity (Q2975575) (← links)
- Acyclic Edge-Coloring of Planar Graphs (Q3094922) (← links)
- The α-Arboricity of Complete Uniform Hypergraphs (Q3094931) (← links)
- (Q3144348) (← links)
- A Polynomial-Time Algorithm for Outerplanar Diameter Improvement (Q3194712) (← links)
- Computational Mathematics with SageMath (Q4631554) (← links)
- Subdivisions of oriented cycles in digraphs with large chromatic number (Q4646948) (← links)
- (Q4903403) (← links)
- (Q5089305) (← links)
- (Q5136239) (← links)
- (Q5226846) (← links)
- (Q5282808) (← links)
- Interest clustering coefficient: a new metric for directed networks like Twitter (Q5861617) (← links)
- Good edge-labelling of graphs (Q5891094) (← links)
- Good edge-labelling of graphs (Q5916095) (← links)
