On the path separation number of graphs (Q313786): Difference between revisions
From MaRDI portal
Set profile property. |
Normalize DOI. |
||
(4 intermediate revisions by 4 users not shown) | |||
Property / DOI | |||
Property / DOI: 10.1016/j.dam.2016.05.022 / rank | |||
Property / OpenAlex ID | |||
Property / OpenAlex ID: W2964084646 / rank | |||
Normal rank | |||
Property / arXiv ID | |||
Property / arXiv ID: 1312.1724 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q3698835 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q3344024 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q2743189 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: On separating systems / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: On a problem concerning separating systems of a finite set / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Separating path systems / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Perfect matchings extend to Hamilton cycles in hypercubes / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Identifying Codes in Line Graphs / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Identifying path covers in graphs / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Cycles identifying vertices and edges in binary hypercubes and 2-dimensional tori / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Extremal Combinatorics / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q4155536 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q5539649 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Clutter percolation and random graphs / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Hamiltonian circuits in random graphs / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q3279628 / rank | |||
Normal rank | |||
Property / DOI | |||
Property / DOI: 10.1016/J.DAM.2016.05.022 / rank | |||
Normal rank |
Latest revision as of 13:59, 9 December 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | On the path separation number of graphs |
scientific article |
Statements
On the path separation number of graphs (English)
0 references
12 September 2016
0 references
network reliability
0 references
test sets
0 references
path covering
0 references
path separation
0 references
path decomposition
0 references
trees
0 references