On the computational complexity of partial covers of theta graphs (Q2482109): Difference between revisions
From MaRDI portal
Set OpenAlex properties. |
ReferenceBot (talk | contribs) Changed an Item |
||
Property / cites work | |||
Property / cites work: Q4017175 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q4770409 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Role colouring a graph / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: NP completeness of the edge precoloring extension problem on bipartite graphs / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q4474120 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Partial covers of graphs / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Fixed-parameter complexity of \(\lambda\)-labelings / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q4449222 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Labelling Graphs with a Condition at Distance 2 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: On the complexity of H-coloring / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q4828516 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: The NP-Completeness of Edge-Coloring / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Covering regular graphs / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q4373685 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q4223772 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q4344207 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q4472519 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q5466031 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Graph labeling and radio channel assignment / rank | |||
Normal rank |
Latest revision as of 21:33, 27 June 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | On the computational complexity of partial covers of theta graphs |
scientific article |
Statements
On the computational complexity of partial covers of theta graphs (English)
0 references
16 April 2008
0 references
computational complexity
0 references
graph homomorphisms
0 references
theta graphs
0 references