Search Results - Diemunsch, Jennifer

  • Showing 1 - 9 results of 9
Refine Results
  1. 1
    Extremal Theorems for Degree Sequence Packing and the Two-Color Discrete Tomography Problem

    Extremal Theorems for Degree Sequence Packing and the Two-Color Discrete Tomography Problem by Diemunsch, Jennifer, Ferrara, Michael, Jahanbekam, Sogol, Shook, James M.

    Get full text
    Items that this one cites
    Items that cite this one
    Article
    Save to List
    Saved in:
  2. 2
    A characterization of P 5 -free graphs with a homeomorphically irreducible spanning tree

    A characterization of P 5 -free graphs with a homeomorphically irreducible spanning tree by Diemunsch, Jennifer, Furuya, Michitaka, Sharifzadeh, Maryam, Tsuchiya, Shoichi, Wang, David, Wise, Jennifer, Yeager, Elyse

    Get full text
    Items that this one cites
    Items that cite this one
    Article
    Save to List
    Saved in:
  3. 3
    A characterization of -free graphs with a homeomorphically irreducible spanning tree

    A characterization of -free graphs with a homeomorphically irreducible spanning tree by Diemunsch, Jennifer, Furuya, Michitaka, Sharifzadeh, Maryam, Tsuchiya, Shoichi, Wang, David, Wise, Jennifer, Yeager, Elyse

    Get full text
    Article
    Save to List
    Saved in:
  4. 4
    On 2-factors with a bounded number of odd components

    On 2-factors with a bounded number of odd components by Diemunsch, Jennifer, Ferrara, Michael, Graffeo, Samantha, Morris, Timothy

    Published in Discrete mathematics
    Get full text
    Items that this one cites
    Items that cite this one
    Article
    Save to List
    Saved in:
  5. 5
    A characterization of P5-free graphs with a homeomorphically irreducible spanning tree

    A characterization of P5-free graphs with a homeomorphically irreducible spanning tree by Diemunsch, Jennifer, Furuya, Michitaka, Sharifzadeh, Maryam, Tsuchiya, Shoichi, Wang, David, Wise, Jennifer, Yeager, Elyse

    Get full text
    Article
    Save to List
    Saved in:
  6. 6
    Color-blind index in graphs of very low degree

    Color-blind index in graphs of very low degree by Diemunsch, Jennifer, Graber, Nathan, Kramer, Lucas, Larsen, Victor, Nelsen, Lauren M., Nelsen, Luke L., Sigler, Devon, Stolee, Derrick, Suer, Charlie

    Get full text
    Items that this one cites
    Article
    Save to List
    Saved in:
  7. 7
    Rainbow Matchings of Size $\delta(G)$ in Properly Edge-Colored Graphs

    Rainbow Matchings of Size $\delta(G)$ in Properly Edge-Colored Graphs by Diemunsch, Jennifer, Ferrara, Michael, Lo, Allan, Moffatt, Casey, Pfender, Florian, Wenger, Paul S

    Get full text
    Items that cite this one
    Article
    Save to List
    Saved in:
  8. 8
    Color-blind index in graphs of very low degree

    Color-blind index in graphs of very low degree by Diemunsch, Jennifer, Graber, Nathan, Kramer, Lucas, Larsen, Victor, Nelsen, Lauren M, Nelsen, Luke L, Sigler, Devon, Stolee, Derrick, Suer, Charlie

    Published in arXiv.org
    Get full text
    Article
    Save to List
    Saved in:
  9. 9
    On the Strong Chromatic Index of Sparse Graphs

    On the Strong Chromatic Index of Sparse Graphs by DeOrsey, Philip, Diemunsch, Jennifer, Ferrara, Michael, Graber, Nathan, Hartke, Stephen G, Sogol Jahanbekam, Lidicky, Bernard, Nelsen, Luke L, Stolee, Derrick, Sullivan, Eric

    Published in arXiv.org
    Get full text
    Article
    Save to List
    Saved in:

Search Tools: