locally constrained graph homomorphisms jan kratochvíl jan kratochvíl charles university, prague
TRANSCRIPT
![Page 1: Locally constrained graph homomorphisms Jan Kratochvíl Jan Kratochvíl Charles University, Prague](https://reader035.vdocuments.us/reader035/viewer/2022081516/5697bf8c1a28abf838c8bb9d/html5/thumbnails/1.jpg)
Locally constrained graph homomorphisms
Jan KratochvílJan Kratochvíl
Charles University, PragueCharles University, Prague
![Page 2: Locally constrained graph homomorphisms Jan Kratochvíl Jan Kratochvíl Charles University, Prague](https://reader035.vdocuments.us/reader035/viewer/2022081516/5697bf8c1a28abf838c8bb9d/html5/thumbnails/2.jpg)
Outline of the talk
Graph Graph hhomomorphismomomorphism Local constraints - Local constraints -
graph covers graph covers partial covers – frequency partial covers – frequency assignment role assignmentsassignment role assignments
Complexity results and questionsComplexity results and questions
![Page 3: Locally constrained graph homomorphisms Jan Kratochvíl Jan Kratochvíl Charles University, Prague](https://reader035.vdocuments.us/reader035/viewer/2022081516/5697bf8c1a28abf838c8bb9d/html5/thumbnails/3.jpg)
1. Graph homomorphism
Edge preserving vertex mapping between Edge preserving vertex mapping between graphs graphs G G and and HH
f f : : VV((GG) ) VV((HH) s.t.) s.t.
uv uv EE((GG) ) ff((uu))ff((vv)) EE((HH) )
![Page 4: Locally constrained graph homomorphisms Jan Kratochvíl Jan Kratochvíl Charles University, Prague](https://reader035.vdocuments.us/reader035/viewer/2022081516/5697bf8c1a28abf838c8bb9d/html5/thumbnails/4.jpg)
u
v
f(u)
f(v)f
G H
![Page 5: Locally constrained graph homomorphisms Jan Kratochvíl Jan Kratochvíl Charles University, Prague](https://reader035.vdocuments.us/reader035/viewer/2022081516/5697bf8c1a28abf838c8bb9d/html5/thumbnails/5.jpg)
![Page 6: Locally constrained graph homomorphisms Jan Kratochvíl Jan Kratochvíl Charles University, Prague](https://reader035.vdocuments.us/reader035/viewer/2022081516/5697bf8c1a28abf838c8bb9d/html5/thumbnails/6.jpg)
HH-COLORING-COLORINGInput: A graph Input: A graph GG..
Question: Question: homomorphism homomorphism GG H H??
Thm (Hell, NeThm (Hell, Nešetřilšetřil)): : HH-COLORING-COLORING is is polynomial for polynomial for HH bipartite and NP-complete bipartite and NP-complete otherwise.otherwise.
![Page 7: Locally constrained graph homomorphisms Jan Kratochvíl Jan Kratochvíl Charles University, Prague](https://reader035.vdocuments.us/reader035/viewer/2022081516/5697bf8c1a28abf838c8bb9d/html5/thumbnails/7.jpg)
2. Local constraints
For every For every uu VV((GG),),
ff((NNGG((uu)) )) NNHH((ff((uu))))
![Page 8: Locally constrained graph homomorphisms Jan Kratochvíl Jan Kratochvíl Charles University, Prague](https://reader035.vdocuments.us/reader035/viewer/2022081516/5697bf8c1a28abf838c8bb9d/html5/thumbnails/8.jpg)
u
f
f(u)
G H
![Page 9: Locally constrained graph homomorphisms Jan Kratochvíl Jan Kratochvíl Charles University, Prague](https://reader035.vdocuments.us/reader035/viewer/2022081516/5697bf8c1a28abf838c8bb9d/html5/thumbnails/9.jpg)
Definition: A homomorphism Definition: A homomorphism ff : : G G HH
is calledis called
bijectivebijective
locallylocally injective injective if for every if for every u u VV((GG))
surjectivesurjective
the restricted mapping the restricted mapping f f :: N NGG((uu)) )) NNHH((ff((uu))))
bijectivebijective
isis injective injective ..
surjectivesurjective
![Page 10: Locally constrained graph homomorphisms Jan Kratochvíl Jan Kratochvíl Charles University, Prague](https://reader035.vdocuments.us/reader035/viewer/2022081516/5697bf8c1a28abf838c8bb9d/html5/thumbnails/10.jpg)
2. Locally constrained homomorphisms loc. bijective = graph coversloc. bijective = graph covers loc. injective = partial covers = generalized loc. injective = partial covers = generalized
frequency assignmentfrequency assignment loc. surjective = role assignmentloc. surjective = role assignment
computational complexitycomputational complexity
![Page 11: Locally constrained graph homomorphisms Jan Kratochvíl Jan Kratochvíl Charles University, Prague](https://reader035.vdocuments.us/reader035/viewer/2022081516/5697bf8c1a28abf838c8bb9d/html5/thumbnails/11.jpg)
2.1 Locally bijective homomorphisms = graph covers Topological graph theory, construction of Topological graph theory, construction of
highly symmetric graphs (Biggs, Conway)highly symmetric graphs (Biggs, Conway) Degree preservingDegree preserving
![Page 12: Locally constrained graph homomorphisms Jan Kratochvíl Jan Kratochvíl Charles University, Prague](https://reader035.vdocuments.us/reader035/viewer/2022081516/5697bf8c1a28abf838c8bb9d/html5/thumbnails/12.jpg)
![Page 13: Locally constrained graph homomorphisms Jan Kratochvíl Jan Kratochvíl Charles University, Prague](https://reader035.vdocuments.us/reader035/viewer/2022081516/5697bf8c1a28abf838c8bb9d/html5/thumbnails/13.jpg)
2.1 Locally bijective homomorphisms = graph covers Topological graph theory, construction of Topological graph theory, construction of
highly symmetric graphs (Biggs, Conway)highly symmetric graphs (Biggs, Conway) Degree preservingDegree preserving Local computation (Angluin, Courcelle)Local computation (Angluin, Courcelle)
![Page 14: Locally constrained graph homomorphisms Jan Kratochvíl Jan Kratochvíl Charles University, Prague](https://reader035.vdocuments.us/reader035/viewer/2022081516/5697bf8c1a28abf838c8bb9d/html5/thumbnails/14.jpg)
2.1 Locally bijective homomorphisms = graph covers Topological graph theory, construction of Topological graph theory, construction of
highly symmetric graphs (Biggs, Conway)highly symmetric graphs (Biggs, Conway) Degree preservingDegree preserving Local computation (Angluin, Courcelle)Local computation (Angluin, Courcelle) Degree partition preservingDegree partition preserving
![Page 15: Locally constrained graph homomorphisms Jan Kratochvíl Jan Kratochvíl Charles University, Prague](https://reader035.vdocuments.us/reader035/viewer/2022081516/5697bf8c1a28abf838c8bb9d/html5/thumbnails/15.jpg)
Degree partition – the coarsest partition Degree partition – the coarsest partition
VV((GG) ) = V= V1 1 VV2 2 … … VVt t s.t.s.t.
there exist numbers there exist numbers rrij ij s.t.s.t.
| | NN((vv) ) VVj j | = | = rrij ij for every for every v v VVi i ..
![Page 16: Locally constrained graph homomorphisms Jan Kratochvíl Jan Kratochvíl Charles University, Prague](https://reader035.vdocuments.us/reader035/viewer/2022081516/5697bf8c1a28abf838c8bb9d/html5/thumbnails/16.jpg)
![Page 17: Locally constrained graph homomorphisms Jan Kratochvíl Jan Kratochvíl Charles University, Prague](https://reader035.vdocuments.us/reader035/viewer/2022081516/5697bf8c1a28abf838c8bb9d/html5/thumbnails/17.jpg)
![Page 18: Locally constrained graph homomorphisms Jan Kratochvíl Jan Kratochvíl Charles University, Prague](https://reader035.vdocuments.us/reader035/viewer/2022081516/5697bf8c1a28abf838c8bb9d/html5/thumbnails/18.jpg)
![Page 19: Locally constrained graph homomorphisms Jan Kratochvíl Jan Kratochvíl Charles University, Prague](https://reader035.vdocuments.us/reader035/viewer/2022081516/5697bf8c1a28abf838c8bb9d/html5/thumbnails/19.jpg)
![Page 20: Locally constrained graph homomorphisms Jan Kratochvíl Jan Kratochvíl Charles University, Prague](https://reader035.vdocuments.us/reader035/viewer/2022081516/5697bf8c1a28abf838c8bb9d/html5/thumbnails/20.jpg)
![Page 21: Locally constrained graph homomorphisms Jan Kratochvíl Jan Kratochvíl Charles University, Prague](https://reader035.vdocuments.us/reader035/viewer/2022081516/5697bf8c1a28abf838c8bb9d/html5/thumbnails/21.jpg)
![Page 22: Locally constrained graph homomorphisms Jan Kratochvíl Jan Kratochvíl Charles University, Prague](https://reader035.vdocuments.us/reader035/viewer/2022081516/5697bf8c1a28abf838c8bb9d/html5/thumbnails/22.jpg)
![Page 23: Locally constrained graph homomorphisms Jan Kratochvíl Jan Kratochvíl Charles University, Prague](https://reader035.vdocuments.us/reader035/viewer/2022081516/5697bf8c1a28abf838c8bb9d/html5/thumbnails/23.jpg)
![Page 24: Locally constrained graph homomorphisms Jan Kratochvíl Jan Kratochvíl Charles University, Prague](https://reader035.vdocuments.us/reader035/viewer/2022081516/5697bf8c1a28abf838c8bb9d/html5/thumbnails/24.jpg)
![Page 25: Locally constrained graph homomorphisms Jan Kratochvíl Jan Kratochvíl Charles University, Prague](https://reader035.vdocuments.us/reader035/viewer/2022081516/5697bf8c1a28abf838c8bb9d/html5/thumbnails/25.jpg)
2.1 Locally bijective homomorphisms = graph covers Topological graph theory, construction of Topological graph theory, construction of
highly symmetric graphs (Biggs, Conway)highly symmetric graphs (Biggs, Conway) Degree preservingDegree preserving Local computation (Angluin, Courcelle)Local computation (Angluin, Courcelle) Degree partition preservingDegree partition preserving Finite planar coversFinite planar covers
![Page 26: Locally constrained graph homomorphisms Jan Kratochvíl Jan Kratochvíl Charles University, Prague](https://reader035.vdocuments.us/reader035/viewer/2022081516/5697bf8c1a28abf838c8bb9d/html5/thumbnails/26.jpg)
![Page 27: Locally constrained graph homomorphisms Jan Kratochvíl Jan Kratochvíl Charles University, Prague](https://reader035.vdocuments.us/reader035/viewer/2022081516/5697bf8c1a28abf838c8bb9d/html5/thumbnails/27.jpg)
![Page 28: Locally constrained graph homomorphisms Jan Kratochvíl Jan Kratochvíl Charles University, Prague](https://reader035.vdocuments.us/reader035/viewer/2022081516/5697bf8c1a28abf838c8bb9d/html5/thumbnails/28.jpg)
Conjecture (Negami): A graph has a finite Conjecture (Negami): A graph has a finite planar cover if and only if it is projective planar cover if and only if it is projective planar.planar.
![Page 29: Locally constrained graph homomorphisms Jan Kratochvíl Jan Kratochvíl Charles University, Prague](https://reader035.vdocuments.us/reader035/viewer/2022081516/5697bf8c1a28abf838c8bb9d/html5/thumbnails/29.jpg)
Conjecture (Negami): A graph has a finite Conjecture (Negami): A graph has a finite planar cover if and only if it is projective planar cover if and only if it is projective planar.planar.
Attempts to prove via forbidden minors for Attempts to prove via forbidden minors for projective planar graphs (Negami, Fellows, projective planar graphs (Negami, Fellows, Archdeacon, HliArchdeacon, Hliněnýněný))
![Page 30: Locally constrained graph homomorphisms Jan Kratochvíl Jan Kratochvíl Charles University, Prague](https://reader035.vdocuments.us/reader035/viewer/2022081516/5697bf8c1a28abf838c8bb9d/html5/thumbnails/30.jpg)
Conjecture (Negami): A graph has a finite Conjecture (Negami): A graph has a finite planar cover if and only if it is projective planar cover if and only if it is projective planar.planar.
Attempts to prove via forbidden minors for Attempts to prove via forbidden minors for projective planar graphs (Negami, Fellows, projective planar graphs (Negami, Fellows, Archdeacon, HliArchdeacon, Hliněnýněný))
True if True if KK1,2,2,2 1,2,2,2 does not have a finite planar does not have a finite planar cover.cover.
![Page 31: Locally constrained graph homomorphisms Jan Kratochvíl Jan Kratochvíl Charles University, Prague](https://reader035.vdocuments.us/reader035/viewer/2022081516/5697bf8c1a28abf838c8bb9d/html5/thumbnails/31.jpg)
2.2 Locally injective homomorphisms = partial covers
Observation: A graph Observation: A graph G G allows a locally allows a locally injective homomorphism into a graph injective homomorphism into a graph HH iff iff GG is an induced subgraph of a graph is an induced subgraph of a graph G’ G’ which covers which covers H H fully.fully.
![Page 32: Locally constrained graph homomorphisms Jan Kratochvíl Jan Kratochvíl Charles University, Prague](https://reader035.vdocuments.us/reader035/viewer/2022081516/5697bf8c1a28abf838c8bb9d/html5/thumbnails/32.jpg)
2.2 Locally injective homomorphisms = generalized frequency assignment
![Page 33: Locally constrained graph homomorphisms Jan Kratochvíl Jan Kratochvíl Charles University, Prague](https://reader035.vdocuments.us/reader035/viewer/2022081516/5697bf8c1a28abf838c8bb9d/html5/thumbnails/33.jpg)
L(2,1)-labelings of graphs
(Roberts; Griggs, Yeh;(Roberts; Griggs, Yeh;
Georges, Mauro; Sakai;Georges, Mauro; Sakai;
KrKráál, l, ŠkrekovskiŠkrekovski))
![Page 34: Locally constrained graph homomorphisms Jan Kratochvíl Jan Kratochvíl Charles University, Prague](https://reader035.vdocuments.us/reader035/viewer/2022081516/5697bf8c1a28abf838c8bb9d/html5/thumbnails/34.jpg)
L(2,1)-labelings of graphs
f: Vf: V((GG)) {0,1,2{0,1,2,…,k,…,k}}
uv uv EE((GG) ) | |ff((uu) – ) – ff((vv)| )| 2 2
ddGG((u,vu,v) = 2 ) = 2 ff((uu) ) ff((vv))
![Page 35: Locally constrained graph homomorphisms Jan Kratochvíl Jan Kratochvíl Charles University, Prague](https://reader035.vdocuments.us/reader035/viewer/2022081516/5697bf8c1a28abf838c8bb9d/html5/thumbnails/35.jpg)
L(2,1)-labelings of graphs
f: Vf: V((GG)) {0,1,2{0,1,2,…,k,…,k}}
uv uv EE((GG) ) | |ff((uu) – ) – ff((vv)| )| 2 2
ddGG((u,vu,v) = 2 ) = 2 ff((uu) ) ff((vv))
||ff((uu) – ) – ff((vv)| )| 1 1
![Page 36: Locally constrained graph homomorphisms Jan Kratochvíl Jan Kratochvíl Charles University, Prague](https://reader035.vdocuments.us/reader035/viewer/2022081516/5697bf8c1a28abf838c8bb9d/html5/thumbnails/36.jpg)
L(2,1)-labelings of graphs
f: Vf: V((GG)) {0,1,2{0,1,2,…,k,…,k}}
uv uv EE((GG) ) | |ff((uu) – ) – ff((vv)| )| 2 2
ddGG((u,vu,v) = 2 ) = 2 ff((uu) ) ff((vv))
||ff((uu) – ) – ff((vv)| )| 1 1
LL(2,1)(2,1)((GG)) = = min such min such kk
![Page 37: Locally constrained graph homomorphisms Jan Kratochvíl Jan Kratochvíl Charles University, Prague](https://reader035.vdocuments.us/reader035/viewer/2022081516/5697bf8c1a28abf838c8bb9d/html5/thumbnails/37.jpg)
![Page 38: Locally constrained graph homomorphisms Jan Kratochvíl Jan Kratochvíl Charles University, Prague](https://reader035.vdocuments.us/reader035/viewer/2022081516/5697bf8c1a28abf838c8bb9d/html5/thumbnails/38.jpg)
![Page 39: Locally constrained graph homomorphisms Jan Kratochvíl Jan Kratochvíl Charles University, Prague](https://reader035.vdocuments.us/reader035/viewer/2022081516/5697bf8c1a28abf838c8bb9d/html5/thumbnails/39.jpg)
![Page 40: Locally constrained graph homomorphisms Jan Kratochvíl Jan Kratochvíl Charles University, Prague](https://reader035.vdocuments.us/reader035/viewer/2022081516/5697bf8c1a28abf838c8bb9d/html5/thumbnails/40.jpg)
![Page 41: Locally constrained graph homomorphisms Jan Kratochvíl Jan Kratochvíl Charles University, Prague](https://reader035.vdocuments.us/reader035/viewer/2022081516/5697bf8c1a28abf838c8bb9d/html5/thumbnails/41.jpg)
![Page 42: Locally constrained graph homomorphisms Jan Kratochvíl Jan Kratochvíl Charles University, Prague](https://reader035.vdocuments.us/reader035/viewer/2022081516/5697bf8c1a28abf838c8bb9d/html5/thumbnails/42.jpg)
![Page 43: Locally constrained graph homomorphisms Jan Kratochvíl Jan Kratochvíl Charles University, Prague](https://reader035.vdocuments.us/reader035/viewer/2022081516/5697bf8c1a28abf838c8bb9d/html5/thumbnails/43.jpg)
L(2,1)-labelings of graphs
NP-complete for every fixed NP-complete for every fixed k k 4 (Fiala, 4 (Fiala, Kloks, JK)Kloks, JK)
Polynomial for graphs of bounded tree-Polynomial for graphs of bounded tree-width (when width (when k k fixed)fixed)
![Page 44: Locally constrained graph homomorphisms Jan Kratochvíl Jan Kratochvíl Charles University, Prague](https://reader035.vdocuments.us/reader035/viewer/2022081516/5697bf8c1a28abf838c8bb9d/html5/thumbnails/44.jpg)
L(2,1)-labelings of graphs
NP-complete for every fixed NP-complete for every fixed k k 4 (Fiala, Kloks, 4 (Fiala, Kloks, JK)JK)
Polynomial for graphs of bounded tree-width Polynomial for graphs of bounded tree-width (when (when k k fixed)fixed)
Polynomial for trees when Polynomial for trees when k k part of input (Chang, part of input (Chang, Kuo) Kuo)
Open for graphs of bounded tree-width (when Open for graphs of bounded tree-width (when k k part of input)part of input)
![Page 45: Locally constrained graph homomorphisms Jan Kratochvíl Jan Kratochvíl Charles University, Prague](https://reader035.vdocuments.us/reader035/viewer/2022081516/5697bf8c1a28abf838c8bb9d/html5/thumbnails/45.jpg)
H(2,1)-labelings of graphs
(Fiala, JK 2001)(Fiala, JK 2001)
![Page 46: Locally constrained graph homomorphisms Jan Kratochvíl Jan Kratochvíl Charles University, Prague](https://reader035.vdocuments.us/reader035/viewer/2022081516/5697bf8c1a28abf838c8bb9d/html5/thumbnails/46.jpg)
H(2,1)-labelings of graphs
(Fiala, JK 2001)(Fiala, JK 2001)
CCkk(2,1)-labelings have been considered by (2,1)-labelings have been considered by
Leese et al.Leese et al.
![Page 47: Locally constrained graph homomorphisms Jan Kratochvíl Jan Kratochvíl Charles University, Prague](https://reader035.vdocuments.us/reader035/viewer/2022081516/5697bf8c1a28abf838c8bb9d/html5/thumbnails/47.jpg)
H(2,1)-labelings of graphs
f: Vf: V((GG)) V V((HH))
uv uv EE((GG) ) ddH H (( ff((uu), ), ff((vv)) )) 2 2
ddGG((u,vu,v) = 2 ) = 2 ff((uu) ) ff((vv))
![Page 48: Locally constrained graph homomorphisms Jan Kratochvíl Jan Kratochvíl Charles University, Prague](https://reader035.vdocuments.us/reader035/viewer/2022081516/5697bf8c1a28abf838c8bb9d/html5/thumbnails/48.jpg)
H(2,1)-labelings of graphs
f: Vf: V((GG)) V V((HH))
uv uv EE((GG) ) ddH H (( ff((uu), ), ff((vv)) )) 2 2
ff((uu))ff((vv) ) EE((HH) )
ddGG((u,vu,v) = 2 ) = 2 ff((uu) ) ff((vv))
![Page 49: Locally constrained graph homomorphisms Jan Kratochvíl Jan Kratochvíl Charles University, Prague](https://reader035.vdocuments.us/reader035/viewer/2022081516/5697bf8c1a28abf838c8bb9d/html5/thumbnails/49.jpg)
H(2,1)-labelings of graphs
f: Vf: V((GG)) V V((HH))
uv uv EE((GG) ) ff((uu))ff((vv) ) EE(-(-HH) )
ddGG((u,vu,v) = 2 ) = 2 ff((uu) ) ff((vv))
![Page 50: Locally constrained graph homomorphisms Jan Kratochvíl Jan Kratochvíl Charles University, Prague](https://reader035.vdocuments.us/reader035/viewer/2022081516/5697bf8c1a28abf838c8bb9d/html5/thumbnails/50.jpg)
H(2,1)-labelings of graphs
f: Vf: V((GG)) V V((HH))
uv uv EE((GG) ) ff((uu))ff((vv) ) EE(-(-HH) )
homomorphism from homomorphism from G G to -to -HH
ddGG((u,vu,v) = 2 ) = 2 ff((uu) ) ff((vv))
locally injective locally injective
![Page 51: Locally constrained graph homomorphisms Jan Kratochvíl Jan Kratochvíl Charles University, Prague](https://reader035.vdocuments.us/reader035/viewer/2022081516/5697bf8c1a28abf838c8bb9d/html5/thumbnails/51.jpg)
H(2,1)-labelings of graphs
=
locally injective homomorphismsinto –H
![Page 52: Locally constrained graph homomorphisms Jan Kratochvíl Jan Kratochvíl Charles University, Prague](https://reader035.vdocuments.us/reader035/viewer/2022081516/5697bf8c1a28abf838c8bb9d/html5/thumbnails/52.jpg)
L2,1(G) k
iff
G allows a Pk+1(2,1)-labeling
iff
G allows a locally injective homomorphism into -Pk+1 .
![Page 53: Locally constrained graph homomorphisms Jan Kratochvíl Jan Kratochvíl Charles University, Prague](https://reader035.vdocuments.us/reader035/viewer/2022081516/5697bf8c1a28abf838c8bb9d/html5/thumbnails/53.jpg)
2.3 Locally surjective homomorphisms = role assignemts
Application in sociology – target vertices are Application in sociology – target vertices are roles in community, preimages are roles in community, preimages are members of a social groupmembers of a social group
![Page 54: Locally constrained graph homomorphisms Jan Kratochvíl Jan Kratochvíl Charles University, Prague](https://reader035.vdocuments.us/reader035/viewer/2022081516/5697bf8c1a28abf838c8bb9d/html5/thumbnails/54.jpg)
3. Computational complexity
HH-COLORING-COLORINGInput: A graph Input: A graph GG..
Question: Question: homomorphism homomorphism GG H H??
Thm (Hell, NeThm (Hell, Nešetřilšetřil)): : HH-COLORING-COLORING is is polynomial for polynomial for HH bipartite and NP-complete bipartite and NP-complete otherwise.otherwise.
![Page 55: Locally constrained graph homomorphisms Jan Kratochvíl Jan Kratochvíl Charles University, Prague](https://reader035.vdocuments.us/reader035/viewer/2022081516/5697bf8c1a28abf838c8bb9d/html5/thumbnails/55.jpg)
3.1 Locally surjective
HH--ROLE-ASSIGNMENTROLE-ASSIGNMENT
Input: A graph Input: A graph GG..
Question: Question: locally surjective locally surjective homomorphism homomorphism GG H H??
Thm (Kristiansen, Telle 2000; Thm (Kristiansen, Telle 2000; Fiala, Paulusma Fiala, Paulusma 20022002)): : HH--ROLE-ASSIGNMENT is polynomial ROLE-ASSIGNMENT is polynomial for for connected connected HH with at most 3 vertices and NP- with at most 3 vertices and NP-complete otherwise.complete otherwise.
![Page 56: Locally constrained graph homomorphisms Jan Kratochvíl Jan Kratochvíl Charles University, Prague](https://reader035.vdocuments.us/reader035/viewer/2022081516/5697bf8c1a28abf838c8bb9d/html5/thumbnails/56.jpg)
3.2 Locally bijective
HH-COVER-COVERInput: A graph Input: A graph GG..
Question: Question: locally bijective homomorphism locally bijective homomorphism GG H H??
![Page 57: Locally constrained graph homomorphisms Jan Kratochvíl Jan Kratochvíl Charles University, Prague](https://reader035.vdocuments.us/reader035/viewer/2022081516/5697bf8c1a28abf838c8bb9d/html5/thumbnails/57.jpg)
Complexity of H-COVER
Bodlaender 1989Bodlaender 1989 Abello, Fellows, Stilwell 1991Abello, Fellows, Stilwell 1991 JK, Proskurowski, Telle 1994, 1996, 1997JK, Proskurowski, Telle 1994, 1996, 1997 JiJiří ří FFialaiala 2000 2000
![Page 58: Locally constrained graph homomorphisms Jan Kratochvíl Jan Kratochvíl Charles University, Prague](https://reader035.vdocuments.us/reader035/viewer/2022081516/5697bf8c1a28abf838c8bb9d/html5/thumbnails/58.jpg)
Complexity of H-COVER
NP-complete for NP-complete for kk-regular graphs -regular graphs HH ( (kk33))
![Page 59: Locally constrained graph homomorphisms Jan Kratochvíl Jan Kratochvíl Charles University, Prague](https://reader035.vdocuments.us/reader035/viewer/2022081516/5697bf8c1a28abf838c8bb9d/html5/thumbnails/59.jpg)
Complexity of H-COVER
NP-complete for NP-complete for kk-regular graphs -regular graphs HH ( (kk33)) Polynomial for graphs with at most 2 Polynomial for graphs with at most 2
vertices in each block of the degree vertices in each block of the degree partitionpartition
![Page 60: Locally constrained graph homomorphisms Jan Kratochvíl Jan Kratochvíl Charles University, Prague](https://reader035.vdocuments.us/reader035/viewer/2022081516/5697bf8c1a28abf838c8bb9d/html5/thumbnails/60.jpg)
Complexity of H-COVER
NP-complete for NP-complete for kk-regular graphs -regular graphs HH ( (kk33)) Polynomial for graphs with at most 2 Polynomial for graphs with at most 2
vertices in each block of the degree vertices in each block of the degree partitionpartition
Polynomial for graphs arising from affine Polynomial for graphs arising from affine mappingsmappings
![Page 61: Locally constrained graph homomorphisms Jan Kratochvíl Jan Kratochvíl Charles University, Prague](https://reader035.vdocuments.us/reader035/viewer/2022081516/5697bf8c1a28abf838c8bb9d/html5/thumbnails/61.jpg)
Complexity of H-COVER NP-complete for NP-complete for kk-regular graphs -regular graphs HH ( (kk33)) Polynomial for graphs with at most 2 Polynomial for graphs with at most 2
vertices in each block of the degree partitionvertices in each block of the degree partition Polynomial for graphs arising from affine Polynomial for graphs arising from affine
mappingsmappings Polynomial for Theta graphs (based on Polynomial for Theta graphs (based on
KKönig-Hall theoremönig-Hall theorem))
![Page 62: Locally constrained graph homomorphisms Jan Kratochvíl Jan Kratochvíl Charles University, Prague](https://reader035.vdocuments.us/reader035/viewer/2022081516/5697bf8c1a28abf838c8bb9d/html5/thumbnails/62.jpg)
![Page 63: Locally constrained graph homomorphisms Jan Kratochvíl Jan Kratochvíl Charles University, Prague](https://reader035.vdocuments.us/reader035/viewer/2022081516/5697bf8c1a28abf838c8bb9d/html5/thumbnails/63.jpg)
![Page 64: Locally constrained graph homomorphisms Jan Kratochvíl Jan Kratochvíl Charles University, Prague](https://reader035.vdocuments.us/reader035/viewer/2022081516/5697bf8c1a28abf838c8bb9d/html5/thumbnails/64.jpg)
Theorem (KPT): Theorem (KPT): GG covers covers ((aa11nn11,a,a22
nn22,…,a,…,akknnkk) if ) if
and only if and only if GG contains only vertices of contains only vertices of degrees 2 and degrees 2 and d = nd = n1 1 + n+ n22 + … + n + … + nk, k, and the and the
vertices of degree vertices of degree dd can be colored by two can be colored by two colors colors red red and and blueblue so that each one is so that each one is connected by exactly connected by exactly nni i paths of length paths of length aai i to to
the vertices of the opposite color.the vertices of the opposite color.
![Page 65: Locally constrained graph homomorphisms Jan Kratochvíl Jan Kratochvíl Charles University, Prague](https://reader035.vdocuments.us/reader035/viewer/2022081516/5697bf8c1a28abf838c8bb9d/html5/thumbnails/65.jpg)
G
((aa11nn11,a,a22
nn22,…,a,…,akknnkk))
![Page 66: Locally constrained graph homomorphisms Jan Kratochvíl Jan Kratochvíl Charles University, Prague](https://reader035.vdocuments.us/reader035/viewer/2022081516/5697bf8c1a28abf838c8bb9d/html5/thumbnails/66.jpg)
![Page 67: Locally constrained graph homomorphisms Jan Kratochvíl Jan Kratochvíl Charles University, Prague](https://reader035.vdocuments.us/reader035/viewer/2022081516/5697bf8c1a28abf838c8bb9d/html5/thumbnails/67.jpg)
((aaiinnii))
G’
![Page 68: Locally constrained graph homomorphisms Jan Kratochvíl Jan Kratochvíl Charles University, Prague](https://reader035.vdocuments.us/reader035/viewer/2022081516/5697bf8c1a28abf838c8bb9d/html5/thumbnails/68.jpg)
![Page 69: Locally constrained graph homomorphisms Jan Kratochvíl Jan Kratochvíl Charles University, Prague](https://reader035.vdocuments.us/reader035/viewer/2022081516/5697bf8c1a28abf838c8bb9d/html5/thumbnails/69.jpg)
![Page 70: Locally constrained graph homomorphisms Jan Kratochvíl Jan Kratochvíl Charles University, Prague](https://reader035.vdocuments.us/reader035/viewer/2022081516/5697bf8c1a28abf838c8bb9d/html5/thumbnails/70.jpg)
Complexity of H-COVER NP-complete for NP-complete for kk-regular graphs -regular graphs HH ( (kk33)) Polynomial for graphs with at most 2 Polynomial for graphs with at most 2
vertices in each block of the degree partitionvertices in each block of the degree partition Polynomial for graphs arising from affine Polynomial for graphs arising from affine
mappingsmappings Polynomial for Theta graphs (based on Polynomial for Theta graphs (based on
KKönig-Hall theoremönig-Hall theorem)) Full characterization for Weight graphsFull characterization for Weight graphs
![Page 71: Locally constrained graph homomorphisms Jan Kratochvíl Jan Kratochvíl Charles University, Prague](https://reader035.vdocuments.us/reader035/viewer/2022081516/5697bf8c1a28abf838c8bb9d/html5/thumbnails/71.jpg)
WW((aa11nn11,a,a22
nn22,…,a,…,akknnkk;a;a11
ll11,a,a22ll22,…,a,…,akk
llk k ;a;a11mm11,a,a22
mm22,…,a,…,akkmmkk))
![Page 72: Locally constrained graph homomorphisms Jan Kratochvíl Jan Kratochvíl Charles University, Prague](https://reader035.vdocuments.us/reader035/viewer/2022081516/5697bf8c1a28abf838c8bb9d/html5/thumbnails/72.jpg)
Theorem (KPT): The W-COVER problem is Theorem (KPT): The W-COVER problem is NP-complete if NP-complete if
nni i = m= mi i for all for all i, i, andand
nni i . l. li i > 0 for some > 0 for some ii
and polynomial time solvable otherwise.and polynomial time solvable otherwise.
![Page 73: Locally constrained graph homomorphisms Jan Kratochvíl Jan Kratochvíl Charles University, Prague](https://reader035.vdocuments.us/reader035/viewer/2022081516/5697bf8c1a28abf838c8bb9d/html5/thumbnails/73.jpg)
3.3 Locally injective
HH-PARTIAL-COVER-PARTIAL-COVERInput: A graph Input: A graph GG..
Question: Question: locally injective homomorphism locally injective homomorphism GG H H??
![Page 74: Locally constrained graph homomorphisms Jan Kratochvíl Jan Kratochvíl Charles University, Prague](https://reader035.vdocuments.us/reader035/viewer/2022081516/5697bf8c1a28abf838c8bb9d/html5/thumbnails/74.jpg)
TheoremTheorem (FK): If (FK): If GG and and HH have the same have the same degree refinement matrix, then every degree refinement matrix, then every locally injective homomorphism locally injective homomorphism ff : : G G H H is locally bijective. is locally bijective.
![Page 75: Locally constrained graph homomorphisms Jan Kratochvíl Jan Kratochvíl Charles University, Prague](https://reader035.vdocuments.us/reader035/viewer/2022081516/5697bf8c1a28abf838c8bb9d/html5/thumbnails/75.jpg)
TheoremTheorem (FK): If (FK): If GG and and HH have the same have the same degree refinement matrix, then every degree refinement matrix, then every locally injective homomorphism locally injective homomorphism ff : : G G H H is locally bijective. is locally bijective.
Corollary: Corollary: HH-COVER -COVER HH-PARTIAL--PARTIAL-COVERCOVER
![Page 76: Locally constrained graph homomorphisms Jan Kratochvíl Jan Kratochvíl Charles University, Prague](https://reader035.vdocuments.us/reader035/viewer/2022081516/5697bf8c1a28abf838c8bb9d/html5/thumbnails/76.jpg)
TheoremTheorem (FK): If (FK): If GG and and HH have the same have the same
degree refinement matrix, then every locally degree refinement matrix, then every locally injective homomorphism injective homomorphism ff : : G G H H is is locally bijective. locally bijective.
Corollary: Corollary: HH-COVER -COVER HH-PARTIAL--PARTIAL-COVERCOVER
Corollary: Corollary: CCkk(2,1)-labeling is NP-complete for (2,1)-labeling is NP-complete for
every every k k 6. 6.
![Page 77: Locally constrained graph homomorphisms Jan Kratochvíl Jan Kratochvíl Charles University, Prague](https://reader035.vdocuments.us/reader035/viewer/2022081516/5697bf8c1a28abf838c8bb9d/html5/thumbnails/77.jpg)
Partial covers of Theta graphs
![Page 78: Locally constrained graph homomorphisms Jan Kratochvíl Jan Kratochvíl Charles University, Prague](https://reader035.vdocuments.us/reader035/viewer/2022081516/5697bf8c1a28abf838c8bb9d/html5/thumbnails/78.jpg)
Partial covers of Theta graphs
ThmThm (Fiala, JK) (Fiala, JK): : ((aakk,b,bmm)-PARTIAL-COVER is)-PARTIAL-COVER is
- polynomial if - polynomial if a,b a,b are oddare odd
- NP-complete if - NP-complete if a-b a-b is oddis odd
![Page 79: Locally constrained graph homomorphisms Jan Kratochvíl Jan Kratochvíl Charles University, Prague](https://reader035.vdocuments.us/reader035/viewer/2022081516/5697bf8c1a28abf838c8bb9d/html5/thumbnails/79.jpg)
Partial covers of Theta graphs
ThmThm (FK) (FK): : ((aakk,b,bmm)-PARTIAL-COVER is)-PARTIAL-COVER is
- polynomial if - polynomial if a,b a,b are oddare odd
- NP-complete if - NP-complete if a-b a-b is oddis odd
Thm (Fiala, JK, PThm (Fiala, JK, Pórór): ): ((a,b,ca,b,c)-PARTIAL-COVER is)-PARTIAL-COVER is
NP-complete if NP-complete if a,b,c a,b,c are distinct odd integersare distinct odd integers
![Page 80: Locally constrained graph homomorphisms Jan Kratochvíl Jan Kratochvíl Charles University, Prague](https://reader035.vdocuments.us/reader035/viewer/2022081516/5697bf8c1a28abf838c8bb9d/html5/thumbnails/80.jpg)
Partial covers of Theta graphs
Thm: Thm: ((aakk,b,bmm)-PARTIAL-COVER is)-PARTIAL-COVER is
- polynomial if - polynomial if a,b a,b are oddare odd
- NP-complete if - NP-complete if a-b a-b is oddis odd
Thm: Thm: ((a,b,ca,b,c)-PARTIAL-COVER is)-PARTIAL-COVER is
NP-complete if NP-complete if a,b,c a,b,c are distinct odd integersare distinct odd integers
ThmThm (FK) (FK): : ((a,b,ca,b,c)-PARTIAL-COVER is)-PARTIAL-COVER is
NP-complete if NP-complete if a+b|ca+b|c
![Page 81: Locally constrained graph homomorphisms Jan Kratochvíl Jan Kratochvíl Charles University, Prague](https://reader035.vdocuments.us/reader035/viewer/2022081516/5697bf8c1a28abf838c8bb9d/html5/thumbnails/81.jpg)
Proof
Given cubic bipartite graph Given cubic bipartite graph GG, it is NP-complete to , it is NP-complete to decide if the vertices of decide if the vertices of GG can be bicolored so that can be bicolored so that every vertex has exactly one neighbor of the other every vertex has exactly one neighbor of the other color (color (WW(1;1;1)-COVER)(1;1;1)-COVER)..
![Page 82: Locally constrained graph homomorphisms Jan Kratochvíl Jan Kratochvíl Charles University, Prague](https://reader035.vdocuments.us/reader035/viewer/2022081516/5697bf8c1a28abf838c8bb9d/html5/thumbnails/82.jpg)
Proof
Given cubic bipartite graph Given cubic bipartite graph GG, it is NP-complete to , it is NP-complete to decide if the vertices of decide if the vertices of GG can be bicolored so that can be bicolored so that every vertex has exactly one neighbor of the other every vertex has exactly one neighbor of the other color (color (WW(1;1;1)-COVER)(1;1;1)-COVER)..
Given Given GG, construct , construct G’G’ by replacing its edges by paths by replacing its edges by paths of length of length c. c.
![Page 83: Locally constrained graph homomorphisms Jan Kratochvíl Jan Kratochvíl Charles University, Prague](https://reader035.vdocuments.us/reader035/viewer/2022081516/5697bf8c1a28abf838c8bb9d/html5/thumbnails/83.jpg)
![Page 84: Locally constrained graph homomorphisms Jan Kratochvíl Jan Kratochvíl Charles University, Prague](https://reader035.vdocuments.us/reader035/viewer/2022081516/5697bf8c1a28abf838c8bb9d/html5/thumbnails/84.jpg)
![Page 85: Locally constrained graph homomorphisms Jan Kratochvíl Jan Kratochvíl Charles University, Prague](https://reader035.vdocuments.us/reader035/viewer/2022081516/5697bf8c1a28abf838c8bb9d/html5/thumbnails/85.jpg)
c = a + b + a + b + … + a + b c = a + b + a + b + … + a + b
= b + a + b + a + … + b + a= b + a + b + a + … + b + a
= c = c
![Page 86: Locally constrained graph homomorphisms Jan Kratochvíl Jan Kratochvíl Charles University, Prague](https://reader035.vdocuments.us/reader035/viewer/2022081516/5697bf8c1a28abf838c8bb9d/html5/thumbnails/86.jpg)
G’
![Page 87: Locally constrained graph homomorphisms Jan Kratochvíl Jan Kratochvíl Charles University, Prague](https://reader035.vdocuments.us/reader035/viewer/2022081516/5697bf8c1a28abf838c8bb9d/html5/thumbnails/87.jpg)
G’
G
![Page 88: Locally constrained graph homomorphisms Jan Kratochvíl Jan Kratochvíl Charles University, Prague](https://reader035.vdocuments.us/reader035/viewer/2022081516/5697bf8c1a28abf838c8bb9d/html5/thumbnails/88.jpg)
G
![Page 89: Locally constrained graph homomorphisms Jan Kratochvíl Jan Kratochvíl Charles University, Prague](https://reader035.vdocuments.us/reader035/viewer/2022081516/5697bf8c1a28abf838c8bb9d/html5/thumbnails/89.jpg)
G’
![Page 90: Locally constrained graph homomorphisms Jan Kratochvíl Jan Kratochvíl Charles University, Prague](https://reader035.vdocuments.us/reader035/viewer/2022081516/5697bf8c1a28abf838c8bb9d/html5/thumbnails/90.jpg)
ProofGiven cubic bipartite graph Given cubic bipartite graph GG, it is NP-complete to decide if , it is NP-complete to decide if
the vertices of the vertices of GG can be bicolored so that every vertex has can be bicolored so that every vertex has exactly one neighbor of the other color (exactly one neighbor of the other color (WW(1;1;1)-COVER)(1;1;1)-COVER)..
Construct Construct G’G’ by replacing its edges by paths of length by replacing its edges by paths of length c. c.
Then Then G’G’ partially covers partially covers ((a,b,ca,b,c) iff ) iff GG covers covers WW(1;1;1).(1;1;1).
![Page 91: Locally constrained graph homomorphisms Jan Kratochvíl Jan Kratochvíl Charles University, Prague](https://reader035.vdocuments.us/reader035/viewer/2022081516/5697bf8c1a28abf838c8bb9d/html5/thumbnails/91.jpg)
(1,2,3)
![Page 92: Locally constrained graph homomorphisms Jan Kratochvíl Jan Kratochvíl Charles University, Prague](https://reader035.vdocuments.us/reader035/viewer/2022081516/5697bf8c1a28abf838c8bb9d/html5/thumbnails/92.jpg)
![Page 93: Locally constrained graph homomorphisms Jan Kratochvíl Jan Kratochvíl Charles University, Prague](https://reader035.vdocuments.us/reader035/viewer/2022081516/5697bf8c1a28abf838c8bb9d/html5/thumbnails/93.jpg)
-(1,2,3) = P5
![Page 94: Locally constrained graph homomorphisms Jan Kratochvíl Jan Kratochvíl Charles University, Prague](https://reader035.vdocuments.us/reader035/viewer/2022081516/5697bf8c1a28abf838c8bb9d/html5/thumbnails/94.jpg)
Eq:
(1,2,3)-PARTIAL-COVER (1,2,3)-PARTIAL-COVER PP55(2,1)-labeling(2,1)-labeling
LL(2,1)(2,1)((GG) ) 4 4
![Page 95: Locally constrained graph homomorphisms Jan Kratochvíl Jan Kratochvíl Charles University, Prague](https://reader035.vdocuments.us/reader035/viewer/2022081516/5697bf8c1a28abf838c8bb9d/html5/thumbnails/95.jpg)
Eq:
(1,2,3)-PARTIAL-COVER (1,2,3)-PARTIAL-COVER PP55(2,1)-labeling(2,1)-labeling
LL(2,1)(2,1)((GG) ) 4 4
And hence all NP-complete.And hence all NP-complete.
![Page 96: Locally constrained graph homomorphisms Jan Kratochvíl Jan Kratochvíl Charles University, Prague](https://reader035.vdocuments.us/reader035/viewer/2022081516/5697bf8c1a28abf838c8bb9d/html5/thumbnails/96.jpg)
Questions – Partial cover
More than 3 paths - More than 3 paths - ((a,b,c,d,…a,b,c,d,…)) Multiple lengths - Multiple lengths - ((aann,b,bmm,c,ckk))
![Page 97: Locally constrained graph homomorphisms Jan Kratochvíl Jan Kratochvíl Charles University, Prague](https://reader035.vdocuments.us/reader035/viewer/2022081516/5697bf8c1a28abf838c8bb9d/html5/thumbnails/97.jpg)
Questions – Partial cover
More than 3 paths - More than 3 paths - ((a,b,c,d,…a,b,c,d,…)) Multiple lengths - Multiple lengths - ((aann,b,bmm,c,ckk))
Beyond Theta graphs – Beyond Theta graphs –
HH-PARTIAL-COVER is conjectured-PARTIAL-COVER is conjectured
NP-complete for NP-complete for HH containing a containing a
subdivision of subdivision of KK44
![Page 98: Locally constrained graph homomorphisms Jan Kratochvíl Jan Kratochvíl Charles University, Prague](https://reader035.vdocuments.us/reader035/viewer/2022081516/5697bf8c1a28abf838c8bb9d/html5/thumbnails/98.jpg)
Questions – Partial cover
Dichotomy ?Dichotomy ? Plausible conjecture ?Plausible conjecture ?
![Page 99: Locally constrained graph homomorphisms Jan Kratochvíl Jan Kratochvíl Charles University, Prague](https://reader035.vdocuments.us/reader035/viewer/2022081516/5697bf8c1a28abf838c8bb9d/html5/thumbnails/99.jpg)
Questions – Cover
Dichotomy ?Dichotomy ?
![Page 100: Locally constrained graph homomorphisms Jan Kratochvíl Jan Kratochvíl Charles University, Prague](https://reader035.vdocuments.us/reader035/viewer/2022081516/5697bf8c1a28abf838c8bb9d/html5/thumbnails/100.jpg)
Questions – Cover
Dichotomy ?Dichotomy ? Perhaps affine graphs and graphs with Perhaps affine graphs and graphs with
Unique Neighbor Property are the only Unique Neighbor Property are the only polynomial cases for polynomial cases for HH-COVER-COVER
![Page 101: Locally constrained graph homomorphisms Jan Kratochvíl Jan Kratochvíl Charles University, Prague](https://reader035.vdocuments.us/reader035/viewer/2022081516/5697bf8c1a28abf838c8bb9d/html5/thumbnails/101.jpg)
Questions – Cover and Partial Cover
Planar instancesPlanar instances
![Page 102: Locally constrained graph homomorphisms Jan Kratochvíl Jan Kratochvíl Charles University, Prague](https://reader035.vdocuments.us/reader035/viewer/2022081516/5697bf8c1a28abf838c8bb9d/html5/thumbnails/102.jpg)
Thank youThank you
![Page 103: Locally constrained graph homomorphisms Jan Kratochvíl Jan Kratochvíl Charles University, Prague](https://reader035.vdocuments.us/reader035/viewer/2022081516/5697bf8c1a28abf838c8bb9d/html5/thumbnails/103.jpg)
6th Czech-Slovak International Symposium
on Graphs and Combinatorics
PraguePrague,, July 10-15, 2006 July 10-15, 2006
In honor of 60In honor of 60thth birthday of Jarik Ne birthday of Jarik Nešetřilšetřil