The following pages link to Michael Jacobson (Q185068):
Displaying 50 items.
- General results on tolerance intersection graphs (Q3984466) (← links)
- (Q4017030) (← links)
- (Q4028480) (← links)
- (Q4029976) (← links)
- (Q4029984) (← links)
- On the <i>p</i>-Edge Clique over Nuber of Complete Bipartite Graphs (Q4030192) (← links)
- Note on graphs without repeated cycle lengths (Q4242924) (← links)
- (Q4262254) (← links)
- Neighborhood unions and the cycle cover number of a graph (Q4312244) (← links)
- Recognizing triangle-free graphs with induced path-cycle double covers is NP-complete (Q4378523) (← links)
- (Q4378526) (← links)
- (Q4390687) (← links)
- (Q4393240) (← links)
- On non-z(mod k) dominating sets (Q4458980) (← links)
- Generalized Ramsey theory and decomposable properties of graphs (Q4498985) (← links)
- Onk-ordered graphs (Q4518332) (← links)
- Destroying symmetry by orienting edges: Complete graphs and complete bigraphs (Q4542862) (← links)
- Degree sum and vertex dominating paths (Q4646935) (← links)
- Saturation numbers for families of graph subdivisions (Q4650190) (← links)
- (Q4660317) (← links)
- Linear forests and ordered cycles (Q4668422) (← links)
- (Q4712022) (← links)
- (Q4734763) (← links)
- (Q4735217) (← links)
- Bounds for the ramsey number of a disconnected graph versus any graph (Q4739938) (← links)
- Fragile graphs with small independent cuts (Q4798123) (← links)
- Forbidden triples implying Hamiltonicity: for all graphs (Q4823293) (← links)
- The 2‐intersection number of paths and bounded‐degree trees (Q4842702) (← links)
- (Q4848847) (← links)
- (Q4871169) (← links)
- (Q4873748) (← links)
- Graphs realizing the same degree sequences and their respective clique numbers (Q4873824) (← links)
- Spanning caterpllars with bounded diameter (Q4882586) (← links)
- (Q4943289) (← links)
- (Q4943520) (← links)
- (Q4943528) (← links)
- Lower bounds for lower Ramsey numbers (Q5202211) (← links)
- (Q5202222) (← links)
- The Bar Visibility Number of a Graph (Q5317561) (← links)
- Degree Conditions for <i>H</i>-Linked Digraphs (Q5397726) (← links)
- (Q5441046) (← links)
- Potential forbidden triples implying hamiltonicity: for sufficiently large graphs (Q5492642) (← links)
- On a conjecture of Quintas and arc-traceability in upset tournaments (Q5492648) (← links)
- Weak saturation numbers for sparse graphs (Q5495050) (← links)
- (Q5688089) (← links)
- Cycle Extendability of Hamiltonian Interval Graphs (Q5757385) (← links)
- Irregularity strength of dense graphs (Q5905417) (← links)
- Even cycles in graphs with many odd cycles (Q5935601) (← links)
- Edge disjoint monochromatic triangles in 2-colored graphs (Q5937583) (← links)
- Two-factors with few cycles in claw-free graphs (Q5937588) (← links)
