×

Gaps in full homomorphism order. (English) Zbl 1378.05134

Drmota, Michael (ed.) et al., Extended abstracts of the ninth European conference on combinatorics, graph theory and applications, EuroComb 2017, Vienna, Austria, August 28 – September 1, 2017. Amsterdam: Elsevier. Electronic Notes in Discrete Mathematics 61, 429-435 (2017).
Summary: We characterise gaps in the full homomorphism order of finite graphs.
For the entire collection see [Zbl 1375.05004].

MSC:

05C60 Isomorphism problems in graph theory (reconstruction conjecture, etc.) and homomorphisms (subgraph embedding, etc.)
PDFBibTeX XMLCite
Full Text: DOI arXiv

References:

[1] Ball, R. N.; Nešetřil, J.; Pultr, A., Dualities in full homomorphisms, Eur. J. Combin., 31, 106-119 (2010) · Zbl 1219.05092
[2] Feder, T.; Hell, P., On realizations of point determining graphs, and obstructions to full homomorphisms, Discrete Math., 308, 1639-1652 (2008) · Zbl 1135.05042
[3] J. Fiala, J. Hubička, Y. Long, Constrained homomorphism orders, i preparation.; J. Fiala, J. Hubička, Y. Long, Constrained homomorphism orders, i preparation.
[4] Hell, P.; Hernández-Cruz, C., Point determining digraphs, {0, 1}-matrix partitions, and dualities in full homomorphisms, Discrete Math., 338, 1755-1762 (2015) · Zbl 1315.05066
[5] Hell, P.; Nešetřil, J., Graphs and homomorphisms, Oxford lecture series in mathematics and its applications (2004), Oxford University Press · Zbl 1062.05139
[6] Hell, P.; Pultr, A., Connected obstructions to full graph homomorphisms, Eur. J. Combin., 41, 278-288 (2014) · Zbl 1300.05181
[7] Nešetřil, J.; Tardif, C., Duality theorems for finite structures (characterising gaps and good characterisations), J. Comb. Theory B, 80, 80-97 (2000) · Zbl 1024.05078
[8] Sumner, D. P., Point determination in graphs, Discrete Math., 5, 179-187 (1973) · Zbl 0265.05124
[9] Xie, W., Obstructions to Trigraph Homomorphisms (2006), Simon Fraser University, Master’s thesis
This reference list is based on information provided by the publisher or from digital mathematics libraries. Its items are heuristically matched to zbMATH identifiers and may contain data conversion errors. In some cases that data have been complemented/enhanced by data from zbMATH Open. This attempts to reflect the references listed in the original paper as accurately as possible without claiming completeness or a perfect matching.