Optimal identification of sets of edges using 2-factors (Q389983): Difference between revisions
From MaRDI portal
Created a new Item |
Changed an Item |
||
| Property / Mathematics Subject Classification ID | |||
| Property / Mathematics Subject Classification ID: 05C76 / rank | |||
Normal rank | |||
| Property / Mathematics Subject Classification ID | |||
| Property / Mathematics Subject Classification ID: 05C69 / rank | |||
Normal rank | |||
| Property / zbMATH DE Number | |||
| Property / zbMATH DE Number: 6248995 / rank | |||
Normal rank | |||
| Property / zbMATH Keywords | |||
edge identification | |||
| Property / zbMATH Keywords: edge identification / rank | |||
Normal rank | |||
| Property / zbMATH Keywords | |||
identifying code | |||
| Property / zbMATH Keywords: identifying code / rank | |||
Normal rank | |||
| Property / zbMATH Keywords | |||
factor of a graph | |||
| Property / zbMATH Keywords: factor of a graph / rank | |||
Normal rank | |||
| Property / zbMATH Keywords | |||
sets of edges | |||
| Property / zbMATH Keywords: sets of edges / rank | |||
Normal rank | |||
Revision as of 14:50, 29 June 2023
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Optimal identification of sets of edges using 2-factors |
scientific article |
Statements
Optimal identification of sets of edges using 2-factors (English)
0 references
22 January 2014
0 references
edge identification
0 references
identifying code
0 references
factor of a graph
0 references
sets of edges
0 references
