Full Text Available
Note: Clicking the button above will open the full text document at the original institutional repository in a new window.
On induced subgraphs of $H(n,3)$ with maximum degree $1$
Saved in:
| Published in: | Discrete Mathematics & Theoretical Computer Science |
|---|---|
| Format: | Online Article RSS Article |
| Published: |
2026
|
| Subjects: | |
| Tags: |
No Tags, Be the first to tag this record!
|
| _version_ | 1867301674866966530 |
|---|---|
| collection | WordPress RSS FRELIP Feed Integration |
| container_title | Discrete Mathematics & Theoretical Computer Science |
| description | |
| discipline_display | Mathematics |
| discipline_facet | Mathematics |
| format | Online Article RSS Article |
| genre | Journal Article |
| id | rss_article:62939 |
| institution | FRELIP |
| journal_source_facet | Discrete Mathematics & Theoretical Computer Science |
| publishDate | 2026 |
| publishDateSort | 2026 |
| record_format | rss_article |
| spellingShingle | On induced subgraphs of $H(n,3)$ with maximum degree $1$ Mathematics General Mathematics |
| sub_discipline_display | General |
| sub_discipline_facet | General |
| subject_display | Mathematics General Mathematics Mathematics General Mathematics |
| subject_facet | Mathematics General Mathematics |
| title | On induced subgraphs of $H(n,3)$ with maximum degree $1$ |
| title_auth | On induced subgraphs of $H(n,3)$ with maximum degree $1$ |
| title_full | On induced subgraphs of $H(n,3)$ with maximum degree $1$ |
| title_fullStr | On induced subgraphs of $H(n,3)$ with maximum degree $1$ |
| title_full_unstemmed | On induced subgraphs of $H(n,3)$ with maximum degree $1$ |
| title_short | On induced subgraphs of $H(n,3)$ with maximum degree $1$ |
| title_sort | on induced subgraphs of $h(n,3)$ with maximum degree $1$ |
| topic | Mathematics General Mathematics |
| url | https://doi.org/10.46298/dmtcs.15440 |