المؤلفون: Goedgebeur, Jan, Jooken, Jorik, Okrasa, Karolina, Rzążewski, Paweł, Schaudt, Oliver

المساهمون: Jan Goedgebeur and Jorik Jooken and Karolina Okrasa and Paweł Rzążewski and Oliver Schaudt

مصطلحات موضوعية: graph homomorphism, critical graphs, hereditary graph classes

وصف الملف: application/pdf

Relation: Is Part Of LIPIcs, Volume 306, 49th International Symposium on Mathematical Foundations of Computer Science (MFCS 2024); https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.MFCS.2024.55

الاتاحة: https://doi.org/10.4230/LIPIcs.MFCS.2024.55
https://nbn-resolving.org/urn:nbn:de:0030-drops-206110
https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.MFCS.2024.55

المؤلفون: Burjons Pujol, Elisabet, Frei, Fabian, Hemaspaandra, Edith, Komm, Dennis, Wehner, David

المساهمون: Universitat Politècnica de Catalunya. Departament de Ciències de la Computació

مصطلحات موضوعية: Àrees temàtiques de la UPC::Informàtica::Informàtica teòrica, Critical graphs, Computational complexity, Structural self-reducibility, Minimality problems, Colorability, Vertex cover, Satisfiability, Reoptimization, Advice, Difference polynomial time, Parallel access to NP

وصف الملف: 27 p.; application/pdf

Relation: https://link.springer.com/article/10.1007/s00453-023-01204-1; http://hdl.handle.net/2117/422522

الاتاحة: http://hdl.handle.net/2117/422522
https://doi.org/10.1007/S00453-023-01204-1

المؤلفون: Burjons, Elisabet, Frei, Fabian, id_orcid:0 000-0002-1368-3205, Hemaspaandra, Edith, Komm, Dennis, Wehner, David

المصدر: Algorithmica, 86 (6)

مصطلحات موضوعية: Critical graphs, Computational complexity, Structural self-reducibility, Minimality problems, Colorability, Vertex cover, Satisfiability, Reoptimization, Advice, Difference polynomial time, Parallel access to NP

وصف الملف: application/application/pdf

Relation: info:eu-repo/semantics/altIdentifier/wos/001176263800001; http://hdl.handle.net/20.500.11850/667305

الاتاحة: https://hdl.handle.net/20.500.11850/667305
https://doi.org/10.3929/ethz-b-000667305

المؤلفون: Martinsson, Anders, Steiner, Raphael, id_orcid:0 000-0001-8391-8949

المصدر: Combinatorics, Probability & Computing

مصطلحات موضوعية: Chromatic number, colour-critical graphs, hypergraphs, probabilistic method

وصف الملف: application/application/pdf

Relation: info:eu-repo/semantics/altIdentifier/wos/001330024000001; info:eu-repo/grantAgreement/SNF/Ambizione/216071; http://hdl.handle.net/20.500.11850/700710

الاتاحة: https://hdl.handle.net/20.500.11850/700710
https://doi.org/10.3929/ethz-b-000700710

المؤلفون: Iršič, Vesna, Lekše, Maruša, Pačnik, Miha, Podlogar, Petra, Praček, Martin

المصدر: Ars mathematica contemporanea, vol. 23, no. 4, 2023. ; ISSN: 1855-3966

مصطلحات موضوعية: crossing-critical graphs, domination number, independence number, prekrižno-kritični grafi, dominantno število, neodvisnostno število, info:eu-repo/classification/udc/519.172

وصف الملف: application/pdf; text/url

Relation: info:eu-repo/grantAgreement/ARIS//P1-0297-2022; info:eu-repo/grantAgreement/ARRS//J1-2452; info:eu-repo/grantAgreement/ARRS//J1-1693; info:eu-repo/grantAgreement/ARRS//N1-0095; info:eu-repo/grantAgreement/ARRS//N1-0218; https://repozitorij.uni-lj.si/IzpisGradiva.php?id=155627; https://repozitorij.uni-lj.si/Dokument.php?id=182615&dn=; https://repozitorij.uni-lj.si/Dokument.php?id=182616&dn=; https://plus.cobiss.net/cobiss/si/sl/bib/146196483; http://hdl.handle.net/20.500.12556/RUL-155627

الاتاحة: https://repozitorij.uni-lj.si/IzpisGradiva.php?id=155627
https://repozitorij.uni-lj.si/Dokument.php?id=182615&dn=
https://repozitorij.uni-lj.si/Dokument.php?id=182616&dn=
https://plus.cobiss.net/cobiss/si/sl/bib/146196483
https://hdl.handle.net/20.500.12556/RUL-155627

المؤلفون: Cai, Qingqiong, Goedgebeur, Jan, Huang, Shenwei

المصدر: DISCRETE APPLIED MATHEMATICS ; ISSN: 0166-218X ; ISSN: 1872-6771

مصطلحات موضوعية: Mathematics and Statistics, Applied Mathematics, Discrete Mathematics and Combinatorics, Graph coloring, k-critical graphs, Forbidden induced subgraphs, Computer generation algorithm, PATHS

وصف الملف: application/pdf

Relation: https://biblio.ugent.be/publication/01HM8WBNR4MNSSX9SK5YFAFESK; http://doi.org/10.1016/j.dam.2023.03.008; https://biblio.ugent.be/publication/01HM8WBNR4MNSSX9SK5YFAFESK/file/01HM8WGN80PSYRRPZ3S5H6GBZH

الاتاحة: https://biblio.ugent.be/publication/01HM8WBNR4MNSSX9SK5YFAFESK
http://hdl.handle.net/1854/LU-01HM8WBNR4MNSSX9SK5YFAFESK
https://doi.org/10.1016/j.dam.2023.03.008
https://biblio.ugent.be/publication/01HM8WBNR4MNSSX9SK5YFAFESK/file/01HM8WGN80PSYRRPZ3S5H6GBZH

المؤلفون: Xia, Wen, Jooken, Jorik, Goedgebeur, Jan, Huang, Shenwei

المساهمون: Wu, Weili, Guo, Jianxiong

المصدر: Combinatorial Optimization and Applications : 16th International Conference, COCOA 2023, Hawaii, HI, USA, December 15–17, 2023, Proceedings, Part II ; ISBN: 9783031496134 ; ISBN: 9783031496141

مصطلحات موضوعية: Mathematics and Statistics, Graph coloring, k-critical graphs, Strong perfect graph theorem, Polynomial-time algorithm

وصف الملف: application/pdf

Relation: https://biblio.ugent.be/publication/01J7X2SMH9KSRVS97EDYNJRMQP; https://biblio.ugent.be/publication/01J7X2SMH9KSRVS97EDYNJRMQP/file/01J7X2ZF0Y5HT4WNRF1WT0ZMGA

الاتاحة: https://biblio.ugent.be/publication/01J7X2SMH9KSRVS97EDYNJRMQP
http://hdl.handle.net/1854/LU-01J7X2SMH9KSRVS97EDYNJRMQP
https://doi.org/10.1007/978-3-031-49614-1_29
https://biblio.ugent.be/publication/01J7X2SMH9KSRVS97EDYNJRMQP/file/01J7X2ZF0Y5HT4WNRF1WT0ZMGA

المؤلفون: P. Kaemawichanurat, T. Jiarasuksakun

المصدر: AKCE International Journal of Graphs and Combinatorics, Vol 15, Iss 2, Pp 190-196 (2018)

مصطلحات موضوعية: domination, connected domination, -critical graphs, clique number, independence number, Mathematics, QA1-939

وصف الملف: electronic resource

Relation: https://doaj.org/toc/0972-8600

URL الوصول: https://doaj.org/article/3dd62dcc7b8d4ddba1be5de322fda184

المؤلفون: Burjons, Elisabet, Frei, Fabian, Hemaspaandra, Edith, Komm, Dennis, Wehner, David

المصدر: Leibniz International Proceedings in Informatics (LIPIcs), 138 ; 44th International Symposium on Mathematical Foundations of Computer Science (MFCS 2019)

مصطلحات موضوعية: Critical Graphs, Computational Complexity, Structural Self-Reducibility, Minimality Problems, Colorability, Vertex Cover, Satisfiability, Reoptimization

وصف الملف: application/application/pdf

Relation: info:eu-repo/semantics/altIdentifier/isbn/978-3-95977-117-7; http://hdl.handle.net/20.500.11850/364010; urn:isbn:978-3-95977-117-7

الاتاحة: https://hdl.handle.net/20.500.11850/364010
https://doi.org/10.3929/ethz-b-000364010

المؤلفون: Pu Wu, Zehui Shao, Enqiang Zhu, Huiqin Jiang, S. Nazari-Moghaddam, Seyed Mahmoud Sheikholeslami

المصدر: IEEE Access, Vol 6, Pp 74737-74746 (2018)

مصطلحات موضوعية: Independent Roman domination, independent Roman stable graph, independent Roman domination vertex critical graphs, Electrical engineering. Electronics. Nuclear engineering, TK1-9971

وصف الملف: electronic resource

Relation: https://ieeexplore.ieee.org/document/8543236/; https://doaj.org/toc/2169-3536

URL الوصول: https://doaj.org/article/8e1ea457ab904da8aebb52da84ee322a

المؤلفون: K. Kayathri, J. Sakila Devi

المصدر: AKCE International Journal of Graphs and Combinatorics, Vol 14, Iss 1, Pp 48-53 (2017)

مصطلحات موضوعية: class one, class two, edge colouring, edge chromatic critical graphs, Mathematics, QA1-939

وصف الملف: electronic resource

Relation: https://doaj.org/toc/0972-8600

URL الوصول: https://doaj.org/article/1387555c691b4165a09975cc032a38b0

المؤلفون: Klostermeyer William F., MacGillivray Gary

المصدر: Discussiones Mathematicae Graph Theory, Vol 37, Iss 1, Pp 63-77 (2017)

مصطلحات موضوعية: dominating set, eternal dominating set, critical graphs, 05c69, Mathematics, QA1-939

وصف الملف: electronic resource

Relation: https://doaj.org/toc/2083-5892

URL الوصول: https://doaj.org/article/10be947b054943719ed3b4c1c3828cad

المؤلفون: Bujtás Csilla, Klavžar Sandi, Košmrlj Gašper

المصدر: Discussiones Mathematicae Graph Theory, Vol 35, Iss 4, Pp 781-796 (2015)

مصطلحات موضوعية: domination number, domination game, domination game critical graphs, powers of cycles, trees, Mathematics, QA1-939

وصف الملف: electronic resource

Relation: https://doaj.org/toc/2083-5892

URL الوصول: https://doaj.org/article/74d677d450ea4f97b4155081653a2fe8

المؤلفون: M.R. Chithra, A. Vijayakumar

المصدر: AKCE International Journal of Graphs and Combinatorics, Vol 12, Iss 1, Pp 19-25 (2015)

مصطلحات موضوعية: Cartesian product, Connected domination, Grid, Critical graphs, Mathematics, QA1-939

وصف الملف: electronic resource

Relation: http://www.sciencedirect.com/science/article/pii/S0972860015000043; https://doaj.org/toc/0972-8600

URL الوصول: https://doaj.org/article/0ebdc1e56e5841119b55b683858936ab

المؤلفون: Radosavljević, Jovan M.

المساهمون: Živković, Miodrag, Marić, Filip, Stanić, Zoran, Koledin, Tamara

المصدر: Универзитет у Београду

مصطلحات موضوعية: графови, критични графови дијаметра 2, примитивни графо- ви, graphs, diameter 2 critical graphs, primitive graphs

وصف الملف: application/pdf

Relation: https://eteze.bg.ac.rs/application/showtheses?thesesId=9672; https://fedorabg.bg.ac.rs/fedora/get/o:33886/bdef:Content/download; https://plus.cobiss.net/cobiss/sr/sr/bib/145026057; https://nardus.mpn.gov.rs/handle/123456789/22530; http://nardus.mpn.gov.rs/bitstream/id/161523/Disertacija_15669.pdf; http://nardus.mpn.gov.rs/bitstream/id/161524/Izvestaj_Komisije_15669.pdf; https://hdl.handle.net/21.15107/rcub_nardus_22530

الاتاحة: https://nardus.mpn.gov.rs/handle/123456789/22530
https://eteze.bg.ac.rs/application/showtheses?thesesId=9672
https://fedorabg.bg.ac.rs/fedora/get/o:33886/bdef:Content/download
https://plus.cobiss.net/cobiss/sr/sr/bib/145026057
http://nardus.mpn.gov.rs/bitstream/id/161523/Disertacija_15669.pdf
http://nardus.mpn.gov.rs/bitstream/id/161524/Izvestaj_Komisije_15669.pdf
https://hdl.handle.net/21.15107/rcub_nardus_22530

المؤلفون: Stiebitz, Michael, Toft, Bjarne

المصدر: Stiebitz , M & Toft , B 2018 , ' A Brooks type theorem for the maximum local edge connectivity ' , The Electronic Journal of Combinatorics , vol. 25 , no. 1 , #P1.50 . https://doi.org/10.37236/6043

مصطلحات موضوعية: math.CO, Graph coloring, Connectivity, Critical graphs, Brooks’ theorem

وصف الملف: application/pdf

الاتاحة: https://portal.findresearcher.sdu.dk/da/publications/8edfb7ca-0888-4ab0-99a4-b115afc762f7
https://doi.org/10.37236/6043
https://findresearcher.sdu.dk/ws/files/142046336/A_Brooks_type_theorem_for_the_maximum_local_edge_connectivity.pdf
https://www.combinatorics.org/ojs/index.php/eljc/article/view/v25i1p50

المؤلفون: Rabern, Landon

المصدر: The Electronic Journal of Combinatorics; Volume 25, Issue 1 (2018); P1.51 ; 1077-8926

مصطلحات موضوعية: List colouring, Online list colouring, Average degree, Critical graphs, 05C15

وصف الملف: application/pdf; application/zip; text/x-tex

Relation: https://www.combinatorics.org/ojs/index.php/eljc/article/view/v25i1p51/pdf; https://www.combinatorics.org/ojs/index.php/eljc/article/view/v25i1p51/7294; https://www.combinatorics.org/ojs/index.php/eljc/article/view/v25i1p51/7319; https://www.combinatorics.org/ojs/index.php/eljc/article/view/v25i1p51

الاتاحة: https://www.combinatorics.org/ojs/index.php/eljc/article/view/v25i1p51
https://doi.org/10.37236/6405

المؤلفون: Noureddine Ikhlef Eschouf, Mostafa Blidia

المصدر: Opuscula Mathematica, Vol 35, Iss 2, Pp 171-180 (2015)

مصطلحات موضوعية: \(b\)-coloring, \(b\)-chromatic number, critical graphs, Applied mathematics. Quantitative methods, T57-57.97

وصف الملف: electronic resource

Relation: http://www.opuscula.agh.edu.pl/vol35/2/art/opuscula_math_3512.pdf; https://doaj.org/toc/1232-9274

URL الوصول: https://doaj.org/article/932a594bda8044bbb0591a8d5717b7ce

المؤلفون: Pang Shiyou, Miao Lianying, Song Wenyao, Miao Zhengke

المصدر: Discussiones Mathematicae Graph Theory, Vol 34, Iss 3, Pp 577-584 (2014)

مصطلحات موضوعية: edge coloring, edge-chromatic critical graphs, independence number, Mathematics, QA1-939

وصف الملف: electronic resource

Relation: https://doaj.org/toc/2083-5892

URL الوصول: https://doaj.org/article/becf8327da144f80bd83ffb4561711aa

المؤلفون: M. Santhi, P. Anitha

المصدر: International Journal of Applied and Advanced Scientific Research, 94-100, (2017-02-13)

مصطلحات موضوعية: Critical Graphs & Degree Sequence

Relation: https://doi.org/; https://doi.org/10.5281/zenodo.290673; oai:zenodo.org:290673

الاتاحة: https://doi.org/10.5281/zenodo.290673