×

Found 39 Documents (Results 1–39)

List homomorphisms to separable signed graphs. (English) Zbl 07683160

Balachandran, Niranjan (ed.) et al., Algorithms and discrete applied mathematics. 8th international conference, CALDAM 2022, Puducherry, India, February 10–12, 2022. Proceedings. Cham: Springer. Lect. Notes Comput. Sci. 13179, 22-35 (2022).
MSC:  68Wxx
PDFBibTeX XMLCite
Full Text: DOI

List homomorphism problems for signed graphs. (English) Zbl 07559391

Esparza, Javier (ed.) et al., 45th international symposium on mathematical foundations of computer science, MFCS 2020, August 25–26, 2020, Prague, Czech Republic. Proceedings. Wadern: Schloss Dagstuhl – Leibniz Zentrum für Informatik. LIPIcs – Leibniz Int. Proc. Inform. 170, Article 20, 14 p. (2020).
MSC:  68Qxx
PDFBibTeX XMLCite
Full Text: DOI arXiv

Correspondence homomorphisms to reflexive graphs. (English) Zbl 1383.05212

Bassino, Frédérique (ed.) et al., LAGOS 2017. Selected papers of the 9th Latin-American algorithms, graphs, and optimization symposium, Marseille, France, September 11–15, 2017. Amsterdam: Elsevier. Electronic Notes in Discrete Mathematics 62, 9-14 (2017).
MSC:  05C60 05C15 68Q25
PDFBibTeX XMLCite
Full Text: DOI

Partitioning chordal graphs. (English) Zbl 1274.05376

Nešetřil, Jarik (ed.) et al., Extended abstracts of the sixth European conference on combinatorics, graph theory and applications, EuroComb 2011, Budapest, Hungary, August 29 – September 2, 2011. Amsterdam: Elsevier. Electronic Notes in Discrete Mathematics 38, 325-330 (2011).
MSC:  05C70 05C50
PDFBibTeX XMLCite
Full Text: Link

Adjusted interval digraphs. (English) Zbl 1267.05257

Koster, Arie (ed.) et al., DIMAP workshop on algorithmic graph theory. Extended abstracts from the workshop held at the University of Warwick, Coventry, UK, March 23–25, 2009. Amsterdam: Elsevier. Electronic Notes in Discrete Mathematics 32, 83-91 (2009).
MSC:  05C85 05C20
PDFBibTeX XMLCite
Full Text: DOI

Matrix partitions with finitely many obstructions. (English) Zbl 1158.05325

Hliněný, Petr (ed.) et al., 6th Czech-Slovak international symposium on combinatorics, graph theory, algorithms and applications, DIMATIA Center, Charles University, Prague, Czech Republic, July 10–16, 2006. Amsterdam: Elsevier. Electronic Notes in Discrete Mathematics 28, 371-378 (2007).
MSC:  05C50 15A99 05C75
PDFBibTeX XMLCite
Full Text: DOI

Generalized colouring (matrix partitions) of cographs. (English) Zbl 1114.05060

Bondy, Adrian (ed.) et al., Graph theory in Paris. Proceedings of a conference, GT04, in memory of Claude Berge, Paris, France, July 2004. Basel: Birkhäuser (ISBN 3-7643-7228-1/hbk). Trends in Mathematics, 149-167 (2007).
MSC:  05C50 05C15
PDFBibTeX XMLCite

Two algorithms for general list matrix partitions. (English) Zbl 1297.68091

Proceedings of the sixteenth annual ACM-SIAM symposium on discrete algorithms, SODA 2005, Vancouver, BC, Canada, January 23–25, 2005. New York, NY: ACM Press (ISBN 0-89871-585-7). 870-876 (2005).
MSC:  68Q25 05C70 05C85
PDFBibTeX XMLCite

List partitions of chordal graphs. (English) Zbl 1196.05060

Farach-Colton, Martin (ed.), LATIN 2004: Theoretical informatics. 6th Latin American symposium, Buenos Aires, Argentina, April 5–8, 2004. Proceedings. Berlin: Springer (ISBN 3-540-21258-2/pbk). Lecture Notes in Computer Science 2976, 100-108 (2004).
MSC:  05C69 68Q17 68Q25
PDFBibTeX XMLCite
Full Text: DOI

Complexity of graph partition problems. (English) Zbl 1345.68171

Vitter, Jeffrey Scott (ed.) et al., Proceedings of the 31st annual ACM symposium on theory of computing, STOC 1999. Atlanta, GA, USA, May 1–4, 1999. New York, NY: ACM, Association for Computing Machinery (ISBN 1-58113-067-8). 464-472 (1999).
PDFBibTeX XMLCite
Full Text: DOI

Filter Results by …

Database

all top 5

Year of Publication

all top 3

Main Field