Q5134450 (Q5134450): Difference between revisions
From MaRDI portal
Set profile property. |
Normalize DOI. |
||
(One intermediate revision by one other user not shown) | |||
Property / DOI | |||
Property / DOI: 10.22108/toc.2016.12473 / rank | |||
Property / cites work | |||
Property / cites work: Q3360909 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: On friendly index sets of 2-regular graphs / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q3620521 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q3070253 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q3429575 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q2935632 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q2933529 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Full friendly index sets of \(P_2 \times P_n\) / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q2870815 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q2869652 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Full friendly index sets of Cartesian products of two cycles / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q3166105 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Full friendly index set. I / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q3166153 / rank | |||
Normal rank | |||
Property / DOI | |||
Property / DOI: 10.22108/TOC.2016.12473 / rank | |||
Normal rank |
Latest revision as of 16:03, 30 December 2024
scientific article; zbMATH DE number 7274720
Language | Label | Description | Also known as |
---|---|---|---|
English | No label defined |
scientific article; zbMATH DE number 7274720 |
Statements
16 November 2020
0 references
edge-friendly index
0 references
edge-friendly labeling
0 references
complete bipartite graph
0 references