The following pages link to Partial covers of graphs (Q4786790):
Displaying 31 items.
- Locally injective \(k\)-colourings of planar graphs (Q400498) (← links)
- Distance three labelings of trees (Q415278) (← links)
- Computing role assignments of proper interval graphs in polynomial time (Q450561) (← links)
- Locally constrained graph homomorphisms -- structure, complexity, and applications (Q458463) (← links)
- Exact algorithms for \(L(2,1)\)-labeling of graphs (Q627538) (← links)
- On distance constrained labeling of disk graphs (Q703553) (← links)
- Computing role assignments of chordal graphs (Q708211) (← links)
- The complexity of locally injective homomorphisms (Q709315) (← links)
- A complete complexity classification of the role assignment problem (Q817773) (← links)
- Cantor--Bernstein type theorem for locally constrained graph homomorphisms (Q852701) (← links)
- Mixed hypergraphs and other coloring problems (Q868365) (← links)
- BCH codes and distance multi- or fractional colorings in hypercubes asymptotically (Q868374) (← links)
- Comparing universal covers in polynomial time (Q987372) (← links)
- Partial and perfect path covers of cographs (Q1281391) (← links)
- List covering of regular multigraphs (Q2169958) (← links)
- Locally constrained homomorphisms on graphs of bounded treewidth and bounded degree (Q2348037) (← links)
- Locally constrained graph homomorphisms and equitable partitions (Q2427537) (← links)
- On the computational complexity of partial covers of theta graphs (Q2482109) (← links)
- Partial covering of hypergraphs (Q2921715) (← links)
- Computing Role Assignments of Proper Interval Graphs in Polynomial Time (Q3000505) (← links)
- Complexity of Locally Injective Homomorphism to the Theta Graphs (Q3000520) (← links)
- Locally Injective Homomorphism to the Simple Weight Graphs (Q3010426) (← links)
- Graph labelings derived from models in distributed computing: A complete complexity classification (Q3100700) (← links)
- (Q3372658) (← links)
- Distance Constrained Labelings of Trees (Q3502639) (← links)
- Comparing Universal Covers in Polynomial Time (Q3503635) (← links)
- (Q3739169) (← links)
- NP completeness of the edge precoloring extension problem on bipartite graphs (Q4406072) (← links)
- On Injective Colourings of Chordal Graphs (Q5458556) (← links)
- List covering of regular multigraphs with semi-edges (Q6119831) (← links)
- An algorithmic framework for locally constrained homomorphisms (Q6499010) (← links)
