×

Found 129 Documents (Results 1–100)

On the oriented coloring of the disjoint union of graphs. (English) Zbl 07495023

Flocchini, Paola (ed.) et al., Combinatorial algorithms. 32nd international workshop, IWOCA 2021, Ottawa, ON, Canada, July 5–7, 2021. Proceedings. Cham: Springer. Lect. Notes Comput. Sci. 12757, 194-207 (2021).
MSC:  68Rxx 68Wxx
PDFBibTeX XMLCite
Full Text: DOI

Graph sandwich problem for the property of being well-covered and partitionable into \(k\) independent sets and \(\ell\) cliques. (English) Zbl 07600805

Kohayakawa, Yoshiharu (ed.) et al., Latin 2020: theoretical informatics. 14th Latin American symposium, São Paulo, Brazil, January 5–8, 2021. Proceedings. Cham: Springer. Lect. Notes Comput. Sci. 12118, 587-599 (2020).
MSC:  68Qxx 68Rxx 68Wxx
PDFBibTeX XMLCite
Full Text: DOI

On caterpillars of game chromatic number 4. (English) Zbl 07515203

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, 461-472 (2019).
MSC:  05Cxx 90Cxx
PDFBibTeX XMLCite
Full Text: DOI

On the complexity of probe and sandwich problems for generalized threshold graphs. (English) Zbl 1417.05152

Mayr, Ernst W. (ed.), Graph-theoretic concepts in computer science. 41st international workshop, WG 2015, Garching, Germany, June 17–19, 2015. Revised papers. Berlin: Springer. Lect. Notes Comput. Sci. 9224, 312-324 (2016).
PDFBibTeX XMLCite
Full Text: DOI

Structural characterization and decomposition for cographs-(2, 1) and (1, 2): a natural generalization of threshold graphs. (English) Zbl 1347.05102

Campêlo, Manoel (ed.) et al., LAGOS ’15. Selected papers of the 8th Latin-American algorithms, graphs, and optimization symposium, Praia das Fontes, Beberibe, Brazil, May 11–15, 2015. Amsterdam: Elsevier. Electronic Notes in Discrete Mathematics 50, 133-138, electronic only (2015).
PDFBibTeX XMLCite
Full Text: DOI

A survey of Solitaire Clobber. (English) Zbl 1380.91038

Nowakowski, Richard J. (ed.), Games of no chance 4. Papers of the BIRS workshop on combinatorial game theory, Banff, Canada, January 20–25, 2008. Cambridge: Cambridge University Press (ISBN 978-1-107-01103-8/hbk). Mathematical Sciences Research Institute Publications 63, 13-39 (2015).
MSC:  91A46 91A43 05C57
PDFBibTeX XMLCite

Edge identifying codes. (English) Zbl 1274.05407

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, 343-348 (2011).
MSC:  05C76 68Q17
PDFBibTeX XMLCite
Full Text: Link

Strong reducibility of powers of paths and powers of cycles on impartial solitaire clobber. (English) Zbl 1268.05131

Bonomo, Flavia (ed.) et al., LAGOS’11 – VI Latin-American algorithms, graphs, and optimization symposium. Extended abstracts from the symposium, Bariloche, Argentina, March 28–April 1, 2011. Amsterdam: Elsevier. Electronic Notes in Discrete Mathematics 37, 177-182 (2011).
MSC:  05C57 91A43 91A46
PDFBibTeX XMLCite
Full Text: DOI

Weighted perfect codes in Lee metric. (English) Zbl 1273.05034

Nešetřil, Jaroslav (ed.) et al., Extended abstracts of the 5th European conference on combinatorics, graph theory and applications, EuroComb’09, Bordeaux, France, September 7–11, 2009. Amsterdam: Elsevier. Electronic Notes in Discrete Mathematics 34, 477-481 (2009).
MSC:  05B40 52C17 94B25
PDFBibTeX XMLCite
Full Text: DOI

Impartial solitaire clobber played on powers of paths. (English) Zbl 1268.05132

Liebling, Thomas M. (ed.) et al., LAGOS’09 – V Latin-American algorithms, graphs, and optimization symposium. Papers from the symposium, Gramado, Brazil, November 3–7, 2009. Amsterdam: Elsevier. Electronic Notes in Discrete Mathematics 35, 257-262 (2009).
MSC:  05C57 91A43
PDFBibTeX XMLCite
Full Text: DOI

Isometric embeddings of subdivided complete graphs in the hypercube. (English) Zbl 1341.05163

Márquez, Alberto (ed.) et al., Proceedings of the 4th European conference on combinatorics, graph theory and applications, EuroComb’07, Seville, Spain, September 11–15, 2007. Amsterdam: Elsevier. Electronic Notes in Discrete Mathematics 29, 277-281 (2007).
MSC:  05C60 05C12 05C65
PDFBibTeX XMLCite
Full Text: DOI

S-constrained random matrices. (English) Zbl 1195.60011

Fourth colloquium on mathematics and computer science IV. Algorithms, trees, combinatorics and probabilities. Papers based on the presentations at the colloquium, Nancy, France, September 18–22, 2006. Nancy: The Association. Discrete Mathematics & Theoretical Computer Science (DMTCS). Discrete Mathematics and Theoretical Computer Science. Proceedings, 357-364, electronic only (2006).
MSC:  60B20
PDFBibTeX XMLCite
Full Text: Link

On clique-inverse graphs of \(K_p\)-free graphs. (English) Zbl 1075.05576

Liebling, T. (ed.) et al., Latin-American conference on combinatorics, graphs and applications. Papers from the conference, Santiago, Chile, August 16–20, 2004. Amsterdam: Elsevier. Electronic Notes in Discrete Mathematics 18, 139-143 (2004).
MSC:  05C69
PDFBibTeX XMLCite
Full Text: Link

Nonplanar vertex deletion: maximum degree thresholds for NP/Max SNP-hardness and a \(\frac 34\)-approximation for finding maximum planar induced subgraphs. (English) Zbl 1075.05602

Liebling, T. (ed.) et al., Latin-American conference on combinatorics, graphs and applications. Papers from the conference, Santiago, Chile, August 16–20, 2004. Amsterdam: Elsevier. Electronic Notes in Discrete Mathematics 18, 121-126 (2004).
MSC:  05C85 68W25
PDFBibTeX XMLCite
Full Text: Link

Filter Results by …

Database

all top 5

Author

all top 5

Year of Publication

all top 3

Main Field

Software