×

Found 273 Documents (Results 1–100)

Partitioning cographs into two forests and one independent set. (English) Zbl 1460.05155

Changat, Manoj (ed.) et al., Algorithms and discrete applied mathematics. 6th international conference, CALDAM 2020, Hyderabad, India, February 13–15, 2020. Proceedings. Cham: Springer. Lect. Notes Comput. Sci. 12016, 15-27 (2020).
MSC:  05C70 05C75 05C69
PDFBibTeX XMLCite
Full Text: DOI

Colouring \(H\)-free graphs of bounded diameter. (English) Zbl 07561658

Rossmanith, Peter (ed.) et al., 44th international symposium on mathematical foundations of computer science, MFCS 2019, Aachen, Germany, August 26–30, 2019. Proceedings. Wadern: Schloss Dagstuhl – Leibniz-Zentrum für Informatik. LIPIcs – Leibniz Int. Proc. Inform. 138, Article 14, 14 p. (2019).
MSC:  05C15 68Q25
PDFBibTeX XMLCite
Full Text: DOI

On adjacent-vertex-distinguishing total colourings of powers of cycles, hypercubes and lattice graphs. (English) Zbl 07515167

Coutinho, Gabriel (ed.) et al., Proceedings of LAGOS 2019, the tenth Latin and American algorithms, graphs and optimization symposium, Belo Horizonte, Brazil, June 2–7 2019. Amsterdam: Elsevier. Electron. Notes Theor. Comput. Sci. 346, 41-51 (2019).
MSC:  05Cxx 90Cxx
PDFBibTeX XMLCite
Full Text: DOI

Colouring \((P_r+P_s)\)-free graphs. (English) Zbl 1532.68068

Hsu, Wen-Lian (ed.) et al., 29th international symposium on algorithms and computation, ISAAC 2018, December 16–19, 2018, Jiaoxi, Yilan, Taiwan. Wadern: Schloss Dagstuhl – Leibniz Zentrum für Informatik. LIPIcs – Leibniz Int. Proc. Inform. 123, Article 5, 13 p. (2018).
MSC:  68R10 05C15 68Q25
PDFBibTeX XMLCite
Full Text: DOI

Structural properties and constant factor-approximation of strong distance-\(r\) dominating sets in sparse directed graphs. (English) Zbl 1402.05180

Vollmer, Heribert (ed.) et al., 34th symposium on theoretical aspects of computer science (STACS 2017), Hannover, Germany, March 8–11, 2017. Proceedings. Wadern: Schloss Dagstuhl – Leibniz Zentrum für Informatik (ISBN 978-3-95977-028-6). LIPIcs – Leibniz International Proceedings in Informatics 66, Article 48, 15 p. (2017).
PDFBibTeX XMLCite
Full Text: DOI

Structure of wheel-trees with colourings and domination numbers. (English) Zbl 1383.05116

Sinha, Deepa (ed.) et al., International conference on current trends in graph theory and computation, CTGTC-2016, New Delhi, India, September 17–19, 2016. Amsterdam: Elsevier. Electronic Notes in Discrete Mathematics 63, 229-236 (2017).
MSC:  05C15 05C69 05C38
PDFBibTeX XMLCite
Full Text: DOI

Chromatic index, treewidth and maximum degree. (English) Zbl 1356.05047

de Mier, Anna (ed.) et al., Discrete mathematical days. Extended abstracts of the 10th “Jornadas de matemática discreta y algorítmica” (JMDA), Barcelona, Spain, July 6–8, 2016. Amsterdam: Elsevier. Electronic Notes in Discrete Mathematics 54, 259-264 (2016).
MSC:  05C15 05C07 05C35
PDFBibTeX XMLCite
Full Text: DOI arXiv

Connected greedy colourings. (English) Zbl 1405.68126

Pardo, Alberto (ed.) et al., LATIN 2014: theoretical informatics. 11th Latin American symposium, Montevideo, Uruguay, March 31 – April 4, 2014. Proceedings. Berlin: Springer (ISBN 978-3-642-54422-4/pbk). Lecture Notes in Computer Science 8392, 433-441 (2014).
MSC:  68Q17 05C15
PDFBibTeX XMLCite
Full Text: DOI

Hierarchical complexity of 2-clique-colouring weakly chordal graphs and perfect graphs having cliques of size at least 3. (English) Zbl 1335.68105

Pardo, Alberto (ed.) et al., LATIN 2014: theoretical informatics. 11th Latin American symposium, Montevideo, Uruguay, March 31 – April 4, 2014. Proceedings. Berlin: Springer (ISBN 978-3-642-54422-4/pbk). Lecture Notes in Computer Science 8392, 13-23 (2014).
PDFBibTeX XMLCite
Full Text: DOI arXiv

Distributed graph coloring. Fundamentals and recent developments. (English) Zbl 1310.68004

Synthesis Lectures on Distributed Computing Theory 11. San Rafael, CA: Morgan & Claypool Publishers (ISBN 978-1-62705-018-0/pbk; 978-1-62705-019-7/ebook). xiii, 157 p. (2013).
PDFBibTeX XMLCite
Full Text: DOI

Filter Results by …

Document Type

all top 5

Author

all top 5

Serial

all top 5

Year of Publication

all top 3

Main Field