Bounding the monomial index and (1,l)-weight choosability of a graph
Graph Theory
| Main Author: | |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
Discrete Mathematics & Theoretical Computer Science
2014-09-01
|
| Series: | Discrete Mathematics & Theoretical Computer Science |
| Subjects: | |
| Online Access: | https://dmtcs.episciences.org/2097/pdf |
| _version_ | 1797270088487796736 |
|---|---|
| author | Ben Seamone |
| author_facet | Ben Seamone |
| author_sort | Ben Seamone |
| collection | DOAJ |
| description | Graph Theory |
| first_indexed | 2024-04-25T01:58:43Z |
| format | Article |
| id | doaj.art-96b79b8b87194e4da371807ea5931242 |
| institution | Directory Open Access Journal |
| issn | 1365-8050 |
| language | English |
| last_indexed | 2024-04-25T01:58:43Z |
| publishDate | 2014-09-01 |
| publisher | Discrete Mathematics & Theoretical Computer Science |
| record_format | Article |
| series | Discrete Mathematics & Theoretical Computer Science |
| spelling | doaj.art-96b79b8b87194e4da371807ea59312422024-03-07T15:27:51ZengDiscrete Mathematics & Theoretical Computer ScienceDiscrete Mathematics & Theoretical Computer Science1365-80502014-09-01Vol. 16 no. 3Graph Theory10.46298/dmtcs.20972097Bounding the monomial index and (1,l)-weight choosability of a graphBen Seamone0https://orcid.org/0000-0003-4852-3532Département d'Informatique et de Recherche Opérationnelle [Montreal]Graph Theoryhttps://dmtcs.episciences.org/2097/pdf1-2-3 conjecturecombinatorial nullstellensatzpermanentsgraph colouringgraph labelling[info.info-dm] computer science [cs]/discrete mathematics [cs.dm] |
| spellingShingle | Ben Seamone Bounding the monomial index and (1,l)-weight choosability of a graph Discrete Mathematics & Theoretical Computer Science 1-2-3 conjecture combinatorial nullstellensatz permanents graph colouring graph labelling [info.info-dm] computer science [cs]/discrete mathematics [cs.dm] |
| title | Bounding the monomial index and (1,l)-weight choosability of a graph |
| title_full | Bounding the monomial index and (1,l)-weight choosability of a graph |
| title_fullStr | Bounding the monomial index and (1,l)-weight choosability of a graph |
| title_full_unstemmed | Bounding the monomial index and (1,l)-weight choosability of a graph |
| title_short | Bounding the monomial index and (1,l)-weight choosability of a graph |
| title_sort | bounding the monomial index and 1 l weight choosability of a graph |
| topic | 1-2-3 conjecture combinatorial nullstellensatz permanents graph colouring graph labelling [info.info-dm] computer science [cs]/discrete mathematics [cs.dm] |
| url | https://dmtcs.episciences.org/2097/pdf |
| work_keys_str_mv | AT benseamone boundingthemonomialindexand1lweightchoosabilityofagraph |