Computational complexity of covering disconnected multigraphs (Q2140489): Difference between revisions
From MaRDI portal
Set profile property. |
ReferenceBot (talk | contribs) Changed an Item |
||
(One intermediate revision by one other user not shown) | |||
Property / full work available at URL | |||
Property / full work available at URL: https://doi.org/10.1007/978-3-030-86593-1_6 / rank | |||
Normal rank | |||
Property / OpenAlex ID | |||
Property / OpenAlex ID: W3199562110 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q4017175 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Algebraic Graph Theory / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q3416074 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Locally Constrained Homomorphisms on Graphs of Bounded Treewidth and Bounded Degree / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Complexity of graph covering problems / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q4373685 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Lifting graph automorphisms by voltage assignments / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q4389332 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q2810314 / rank | |||
Normal rank |
Latest revision as of 02:11, 29 July 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | Computational complexity of covering disconnected multigraphs |
scientific article |
Statements
Computational complexity of covering disconnected multigraphs (English)
0 references
20 May 2022
0 references