Gao, Xiao-Lu; Huang, Jing; Xu, Shou-Jun Comparability digraphs: an analogue of comparability graphs. (English) Zbl 07790214 Discrete Math. 347, No. 3, Article ID 113829, 15 p. (2024). MSC: 05C20 05C75 PDFBibTeX XMLCite \textit{X.-L. Gao} et al., Discrete Math. 347, No. 3, Article ID 113829, 15 p. (2024; Zbl 07790214) Full Text: DOI arXiv
Guzmán-Pro, Santiago Full-homomorphisms to paths and cycles. (English) Zbl 07790194 Discrete Math. 347, No. 3, Article ID 113800, 9 p. (2024). MSC: 05C38 05C60 PDFBibTeX XMLCite \textit{S. Guzmán-Pro}, Discrete Math. 347, No. 3, Article ID 113800, 9 p. (2024; Zbl 07790194) Full Text: DOI arXiv
Łyczek, Katarzyna; Nazarczuk, Maria; Rzążewski, Paweł Towards the Chen-Raspaud conjecture. (English) Zbl 07790192 Discrete Math. 347, No. 3, Article ID 113798, 9 p. (2024). MSC: 05C15 05C60 PDFBibTeX XMLCite \textit{K. Łyczek} et al., Discrete Math. 347, No. 3, Article ID 113798, 9 p. (2024; Zbl 07790192) Full Text: DOI
Bar-Noy, Amotz; Choudhary, Keerti; Peleg, David; Rawitz, Dror Graph realizations: maximum degree in vertex neighborhoods. (English) Zbl 1516.05032 Discrete Math. 346, No. 9, Article ID 113483, 16 p. (2023). MSC: 05C07 05C35 PDFBibTeX XMLCite \textit{A. Bar-Noy} et al., Discrete Math. 346, No. 9, Article ID 113483, 16 p. (2023; Zbl 1516.05032) Full Text: DOI
Chaplick, Steven Intersection graphs of non-crossing paths. (English) Zbl 1515.05152 Discrete Math. 346, No. 8, Article ID 113498, 14 p. (2023). MSC: 05C76 05C38 05C45 05C69 05C05 05C75 PDFBibTeX XMLCite \textit{S. Chaplick}, Discrete Math. 346, No. 8, Article ID 113498, 14 p. (2023; Zbl 1515.05152) Full Text: DOI
La, Hoang; Štorgel, Kenny 2-distance, injective, and exact square list-coloring of planar graphs with maximum degree 4. (English) Zbl 1515.05068 Discrete Math. 346, No. 8, Article ID 113405, 31 p. (2023). MSC: 05C15 05C10 PDFBibTeX XMLCite \textit{H. La} and \textit{K. Štorgel}, Discrete Math. 346, No. 8, Article ID 113405, 31 p. (2023; Zbl 1515.05068) Full Text: DOI arXiv
Francis, Mathew C.; Jacob, Dalu The lexicographic method for the threshold cover problem. (English) Zbl 1511.05194 Discrete Math. 346, No. 6, Article ID 113364, 15 p. (2023). MSC: 05C70 05C85 90C10 68R10 PDFBibTeX XMLCite \textit{M. C. Francis} and \textit{D. Jacob}, Discrete Math. 346, No. 6, Article ID 113364, 15 p. (2023; Zbl 1511.05194) Full Text: DOI
Bok, Jan; Brewster, Richard; Feder, Tomás; Hell, Pavol; Jedličková, Nikola List homomorphism problems for signed trees. (English) Zbl 1506.05082 Discrete Math. 346, No. 3, Article ID 113257, 24 p. (2023). MSC: 05C22 05C05 68Q15 05C60 PDFBibTeX XMLCite \textit{J. Bok} et al., Discrete Math. 346, No. 3, Article ID 113257, 24 p. (2023; Zbl 1506.05082) Full Text: DOI
Alves, Sancrey R.; Couto, Fernanda; Faria, Luerbio; Gravier, Sylvain; Klein, Sulamita; Souza, Uéverton S. Partitions and well-coveredness: the graph sandwich problem. (English) Zbl 1506.05166 Discrete Math. 346, No. 3, Article ID 113253, 10 p. (2023). MSC: 05C70 05C69 68Q17 PDFBibTeX XMLCite \textit{S. R. Alves} et al., Discrete Math. 346, No. 3, Article ID 113253, 10 p. (2023; Zbl 1506.05166) Full Text: DOI
Hsu, Kevin; Huang, Jing Obstructions for acyclic local tournament orientation completions. (English) Zbl 1504.05107 Discrete Math. 346, No. 2, Article ID 113220, 9 p. (2023). MSC: 05C20 PDFBibTeX XMLCite \textit{K. Hsu} and \textit{J. Huang}, Discrete Math. 346, No. 2, Article ID 113220, 9 p. (2023; Zbl 1504.05107) Full Text: DOI arXiv
Lonc, Zbigniew; Petryshyn, Nataliya Edge decompositions and rooted packings of graphs. (English) Zbl 1504.05235 Discrete Math. 345, No. 12, Article ID 113057, 18 p. (2022). Reviewer: Zan-Bo Zhang (Guangzhou) MSC: 05C70 05C75 68Q25 PDFBibTeX XMLCite \textit{Z. Lonc} and \textit{N. Petryshyn}, Discrete Math. 345, No. 12, Article ID 113057, 18 p. (2022; Zbl 1504.05235) Full Text: DOI
Gu, Yangyan; Zhu, Xuding Signed planar graphs with given circular chromatic numbers. (English) Zbl 1495.05121 Discrete Math. 345, No. 11, Article ID 113020, 15 p. (2022). MSC: 05C22 05C10 05C15 PDFBibTeX XMLCite \textit{Y. Gu} and \textit{X. Zhu}, Discrete Math. 345, No. 11, Article ID 113020, 15 p. (2022; Zbl 1495.05121) Full Text: DOI
Wu, Yueyu; Zhang, Yunqing; Chen, Yaojun Degree sums and spanning brooms of a graph. (English) Zbl 1491.05114 Discrete Math. 345, No. 9, Article ID 112966, 9 p. (2022). MSC: 05C38 05C07 05C05 05C35 PDFBibTeX XMLCite \textit{Y. Wu} et al., Discrete Math. 345, No. 9, Article ID 112966, 9 p. (2022; Zbl 1491.05114) Full Text: DOI
Schwartz, Stephan An overview of graph covering and partitioning. (English) Zbl 1490.05220 Discrete Math. 345, No. 8, Article ID 112884, 17 p. (2022). MSC: 05C70 90C27 PDFBibTeX XMLCite \textit{S. Schwartz}, Discrete Math. 345, No. 8, Article ID 112884, 17 p. (2022; Zbl 1490.05220) Full Text: DOI
Pan, Zhishi; Zhu, Xuding The circular chromatic numbers of signed series-parallel graphs. (English) Zbl 1480.05058 Discrete Math. 345, No. 3, Article ID 112733, 10 p. (2022). MSC: 05C15 05C22 PDFBibTeX XMLCite \textit{Z. Pan} and \textit{X. Zhu}, Discrete Math. 345, No. 3, Article ID 112733, 10 p. (2022; Zbl 1480.05058) Full Text: DOI
Bensmail, Julien; Das, Sandip; Nandi, Soumen; Pierron, Théo; Sen, Sagnik; Sopena, Éric On the signed chromatic number of some classes of graphs. (English) Zbl 1479.05093 Discrete Math. 345, No. 2, Article ID 112664, 20 p. (2022). MSC: 05C15 05C22 05C75 05C60 05C10 05C83 PDFBibTeX XMLCite \textit{J. Bensmail} et al., Discrete Math. 345, No. 2, Article ID 112664, 20 p. (2022; Zbl 1479.05093) Full Text: DOI arXiv
Contreras-Mendoza, F. Esteban; Hernández-Cruz, César Minimal obstructions to \(( \infty , k )\)-polarity in cographs. (English) Zbl 1466.05140 Discrete Math. 344, No. 7, Article ID 112407, 13 p. (2021). MSC: 05C62 05C70 PDFBibTeX XMLCite \textit{F. E. Contreras-Mendoza} and \textit{C. Hernández-Cruz}, Discrete Math. 344, No. 7, Article ID 112407, 13 p. (2021; Zbl 1466.05140) Full Text: DOI arXiv
Dalfó, C.; Fiol, M. A.; López, N.; Ryan, J. An improved Moore bound and some new optimal families of mixed abelian Cayley graphs. (English) Zbl 1445.05047 Discrete Math. 343, No. 10, Article ID 112034, 9 p. (2020). MSC: 05C25 PDFBibTeX XMLCite \textit{C. Dalfó} et al., Discrete Math. 343, No. 10, Article ID 112034, 9 p. (2020; Zbl 1445.05047) Full Text: DOI arXiv
Duchêne, Eric; Gledel, Valentin; Parreau, Aline; Renault, Gabriel Maker-Breaker domination game. (English) Zbl 1443.05126 Discrete Math. 343, No. 9, Article ID 111955, 11 p. (2020). MSC: 05C57 05C69 91A43 91A05 05C05 PDFBibTeX XMLCite \textit{E. Duchêne} et al., Discrete Math. 343, No. 9, Article ID 111955, 11 p. (2020; Zbl 1443.05126) Full Text: DOI arXiv
Fieux, Etienne; Jouve, Bertrand A hierarchy of dismantlings in graphs. (English) Zbl 1441.05212 Discrete Math. 343, No. 8, Article ID 111914, 14 p. (2020). MSC: 05C99 05C75 PDFBibTeX XMLCite \textit{E. Fieux} and \textit{B. Jouve}, Discrete Math. 343, No. 8, Article ID 111914, 14 p. (2020; Zbl 1441.05212) Full Text: DOI arXiv
Ozeki, Kenta; Wiener, Gábor; Zamfirescu, Carol T. On minimum leaf spanning trees and a criticality notion. (English) Zbl 1440.05062 Discrete Math. 343, No. 7, Article ID 111884, 7 p. (2020). MSC: 05C05 PDFBibTeX XMLCite \textit{K. Ozeki} et al., Discrete Math. 343, No. 7, Article ID 111884, 7 p. (2020; Zbl 1440.05062) Full Text: DOI
Edwards, Keith; Rzążewski, Paweł Complete colourings of hypergraphs. (English) Zbl 1429.05065 Discrete Math. 343, No. 2, Article ID 111673, 12 p. (2020). MSC: 05C15 05C65 68Q25 PDFBibTeX XMLCite \textit{K. Edwards} and \textit{P. Rzążewski}, Discrete Math. 343, No. 2, Article ID 111673, 12 p. (2020; Zbl 1429.05065) Full Text: DOI Link
Gould, Ronald J.; Shull, Warren On spanning trees with few branch vertices. (English) Zbl 1429.05040 Discrete Math. 343, No. 1, Article ID 111581, 7 p. (2020). MSC: 05C05 05C07 05C40 PDFBibTeX XMLCite \textit{R. J. Gould} and \textit{W. Shull}, Discrete Math. 343, No. 1, Article ID 111581, 7 p. (2020; Zbl 1429.05040) Full Text: DOI
Chen, Yuan; Ha, Pham Hoang; Hanh, Dang Dinh Spanning trees with at most 4 leaves in \(K_{1, 5}\)-free graphs. (English) Zbl 1418.05050 Discrete Math. 342, No. 8, 2342-2349 (2019). MSC: 05C05 05C40 PDFBibTeX XMLCite \textit{Y. Chen} et al., Discrete Math. 342, No. 8, 2342--2349 (2019; Zbl 1418.05050) Full Text: DOI arXiv
Takaoka, Asahi A vertex ordering characterization of simple-triangle graphs. (English) Zbl 1397.05043 Discrete Math. 341, No. 12, 3281-3287 (2018). MSC: 05C10 PDFBibTeX XMLCite \textit{A. Takaoka}, Discrete Math. 341, No. 12, 3281--3287 (2018; Zbl 1397.05043) Full Text: DOI arXiv
Brewster, Richard C.; Siggers, Mark A complexity dichotomy for signed \(\mathbf{H}\)-colouring. (English) Zbl 1393.05108 Discrete Math. 341, No. 10, 2768-2773 (2018). MSC: 05C15 05C22 PDFBibTeX XMLCite \textit{R. C. Brewster} and \textit{M. Siggers}, Discrete Math. 341, No. 10, 2768--2773 (2018; Zbl 1393.05108) Full Text: DOI
González Hermosillo de la Maza, Sebastián; Hernández-Cruz, César On the existence of 3- and 4-kernels in digraphs. (English) Zbl 1378.05079 Discrete Math. 341, No. 3, 638-651 (2018). MSC: 05C20 PDFBibTeX XMLCite \textit{S. González Hermosillo de la Maza} and \textit{C. Hernández-Cruz}, Discrete Math. 341, No. 3, 638--651 (2018; Zbl 1378.05079) Full Text: DOI arXiv
Rapke, T. K.; Seyffarth, K. On nice and injective-nice tournaments. (English) Zbl 1372.05090 Discrete Math. 341, No. 1, 1-19 (2018). MSC: 05C20 05C15 05C60 PDFBibTeX XMLCite \textit{T. K. Rapke} and \textit{K. Seyffarth}, Discrete Math. 341, No. 1, 1--19 (2018; Zbl 1372.05090) Full Text: DOI
Zhou, Jiang; Sun, Lizhu; Bu, Changjiang Resistance characterizations of equiarboreal graphs. (English) Zbl 1370.05087 Discrete Math. 340, No. 12, 2864-2870 (2017). MSC: 05C22 05C05 05C75 PDFBibTeX XMLCite \textit{J. Zhou} et al., Discrete Math. 340, No. 12, 2864--2870 (2017; Zbl 1370.05087) Full Text: DOI
Beckenbach, Isabel; Scheidweiler, Robert Perfect \(f\)-matchings and \(f\)-factors in hypergraphs – a combinatorial approach. (English) Zbl 1367.05149 Discrete Math. 340, No. 10, 2499-2506 (2017). MSC: 05C65 05C70 68Q17 PDFBibTeX XMLCite \textit{I. Beckenbach} and \textit{R. Scheidweiler}, Discrete Math. 340, No. 10, 2499--2506 (2017; Zbl 1367.05149) Full Text: DOI
Sen, Sagnik On homomorphisms of oriented graphs with respect to the push operation. (English) Zbl 1362.05089 Discrete Math. 340, No. 8, 1986-1995 (2017). MSC: 05C60 05C15 05C10 PDFBibTeX XMLCite \textit{S. Sen}, Discrete Math. 340, No. 8, 1986--1995 (2017; Zbl 1362.05089) Full Text: DOI arXiv
Cranston, Daniel W.; West, Douglas B. An introduction to the discharging method via graph coloring. (English) Zbl 1355.05104 Discrete Math. 340, No. 4, 766-793 (2017). MSC: 05C15 05C10 05C07 PDFBibTeX XMLCite \textit{D. W. Cranston} and \textit{D. B. West}, Discrete Math. 340, No. 4, 766--793 (2017; Zbl 1355.05104) Full Text: DOI arXiv
Brewster, Richard C.; Foucaud, Florent; Hell, Pavol; Naserasr, Reza The complexity of signed graph and edge-coloured graph homomorphisms. (English) Zbl 1351.05099 Discrete Math. 340, No. 2, 223-235 (2017). MSC: 05C22 05C15 05C60 PDFBibTeX XMLCite \textit{R. C. Brewster} et al., Discrete Math. 340, No. 2, 223--235 (2017; Zbl 1351.05099) Full Text: DOI arXiv
Chen, Fen; Cao, Haitao Uniformly resolvable decompositions of \(K_v\) into \(K_2\) and \(K_{1, 3}\) graphs. (English) Zbl 1336.05107 Discrete Math. 339, No. 8, 2056-2062 (2016). MSC: 05C70 PDFBibTeX XMLCite \textit{F. Chen} and \textit{H. Cao}, Discrete Math. 339, No. 8, 2056--2062 (2016; Zbl 1336.05107) Full Text: DOI
Sopena, É. Homomorphisms and colourings of oriented graphs: an updated survey. (English) Zbl 1334.05046 Discrete Math. 339, No. 7, 1993-2005 (2016). MSC: 05C15 PDFBibTeX XMLCite \textit{É. Sopena}, Discrete Math. 339, No. 7, 1993--2005 (2016; Zbl 1334.05046) Full Text: DOI
Boros, Endre; Chiarelli, Nina; Milanič, Martin Equistarable bipartite graphs. (English) Zbl 1334.05110 Discrete Math. 339, No. 7, 1960-1969 (2016). MSC: 05C70 PDFBibTeX XMLCite \textit{E. Boros} et al., Discrete Math. 339, No. 7, 1960--1969 (2016; Zbl 1334.05110) Full Text: DOI arXiv
Nakamigawa, Tomoki An extremal problem for vertex partition of complete multipartite graphs. (English) Zbl 1333.05244 Discrete Math. 339, No. 6, 1699-1705 (2016). MSC: 05C70 05C35 PDFBibTeX XMLCite \textit{T. Nakamigawa}, Discrete Math. 339, No. 6, 1699--1705 (2016; Zbl 1333.05244) Full Text: DOI
Das, Ashok Kumar; Das, Sandip; Sen, Malay Forbidden substructure for interval digraphs/bigraphs. (English) Zbl 1327.05132 Discrete Math. 339, No. 2, 1028-1051 (2016). MSC: 05C20 PDFBibTeX XMLCite \textit{A. K. Das} et al., Discrete Math. 339, No. 2, 1028--1051 (2016; Zbl 1327.05132) Full Text: DOI
Lin, Cheyu; Zhu, Xuding Circular total chromatic numbers of graphs. (English) Zbl 1327.05116 Discrete Math. 339, No. 2, 857-865 (2016). MSC: 05C15 PDFBibTeX XMLCite \textit{C. Lin} and \textit{X. Zhu}, Discrete Math. 339, No. 2, 857--865 (2016; Zbl 1327.05116) Full Text: DOI
Saito, Akira; Sano, Kazuki Spanning trees homeomorphic to a small tree. (English) Zbl 1327.05061 Discrete Math. 339, No. 2, 677-681 (2016). MSC: 05C05 05C60 05C45 PDFBibTeX XMLCite \textit{A. Saito} and \textit{K. Sano}, Discrete Math. 339, No. 2, 677--681 (2016; Zbl 1327.05061) Full Text: DOI
Wires, Alexander Dichotomy for finite tournaments of mixed-type. (English) Zbl 1318.05033 Discrete Math. 338, No. 12, 2523-2538 (2015). MSC: 05C20 PDFBibTeX XMLCite \textit{A. Wires}, Discrete Math. 338, No. 12, 2523--2538 (2015; Zbl 1318.05033) Full Text: DOI
Hell, Pavol; Yen, Pei-Lan Join colourings of chordal graphs. (English) Zbl 1318.05058 Discrete Math. 338, No. 12, 2453-2461 (2015). MSC: 05C70 05C15 05C60 PDFBibTeX XMLCite \textit{P. Hell} and \textit{P.-L. Yen}, Discrete Math. 338, No. 12, 2453--2461 (2015; Zbl 1318.05058) Full Text: DOI
Rollick, Nickolas S. Characterization of the finite C-MH-homogeneous graphs. (English) Zbl 1314.05201 Discrete Math. 338, No. 11, 1953-1969 (2015). MSC: 05C85 05C60 PDFBibTeX XMLCite \textit{N. S. Rollick}, Discrete Math. 338, No. 11, 1953--1969 (2015; Zbl 1314.05201) Full Text: DOI
Hell, Pavol; Hernández-Cruz, César Point determining digraphs, \(\{ 0,1 \}\)-matrix partitions, and dualities in full homomorphisms. (English) Zbl 1315.05066 Discrete Math. 338, No. 10, 1755-1762 (2015). MSC: 05C20 PDFBibTeX XMLCite \textit{P. Hell} and \textit{C. Hernández-Cruz}, Discrete Math. 338, No. 10, 1755--1762 (2015; Zbl 1315.05066) Full Text: DOI arXiv
Küçükçifçi, Selda; Milici, Salvatore; Tuza, Zsolt Maximum uniformly resolvable decompositions of \(K_v\) and \(K_v - I\) into 3-stars and 3-cycles. (English) Zbl 1315.05113 Discrete Math. 338, No. 10, 1667-1673 (2015). MSC: 05C70 05C38 PDFBibTeX XMLCite \textit{S. Küçükçifçi} et al., Discrete Math. 338, No. 10, 1667--1673 (2015; Zbl 1315.05113) Full Text: DOI arXiv
Lin, Cheyu; Wong, Tsai-Lien; Zhu, Xuding Circular chromatic indices of even degree regular graphs. (English) Zbl 1309.05077 Discrete Math. 338, No. 7, 1154-1162 (2015). MSC: 05C15 05C07 05C76 PDFBibTeX XMLCite \textit{C. Lin} et al., Discrete Math. 338, No. 7, 1154--1162 (2015; Zbl 1309.05077) Full Text: DOI
Bacsó, Gábor; Borowiecki, Piotr; Hujter, Mihály; Tuza, Zsolt Minimum order of graphs with given coloring parameters. (English) Zbl 1305.05069 Discrete Math. 338, No. 4, 621-632 (2015). MSC: 05C15 05C35 05C85 PDFBibTeX XMLCite \textit{G. Bacsó} et al., Discrete Math. 338, No. 4, 621--632 (2015; Zbl 1305.05069) Full Text: DOI arXiv
Küçükçifçi, Selda; Lo Faro, Giovanni; Milici, Salvatore; Tripodi, Antoinette Resolvable 3-star designs. (English) Zbl 1305.05192 Discrete Math. 338, No. 4, 608-614 (2015). MSC: 05C70 05C51 PDFBibTeX XMLCite \textit{S. Küçükçifçi} et al., Discrete Math. 338, No. 4, 608--614 (2015; Zbl 1305.05192) Full Text: DOI arXiv
Foniok, Jan; Tardif, Claude Digraph functors which admit both left and right adjoints. (English) Zbl 1305.05087 Discrete Math. 338, No. 4, 527-535 (2015). MSC: 05C20 05C60 18A40 PDFBibTeX XMLCite \textit{J. Foniok} and \textit{C. Tardif}, Discrete Math. 338, No. 4, 527--535 (2015; Zbl 1305.05087) Full Text: DOI arXiv
Milici, Salvatore; Tuza, Zsolt Uniformly resolvable decompositions of \(K_v\) into \(P_3\) and \(K_3\) graphs. (English) Zbl 1296.05166 Discrete Math. 331, 137-141 (2014). MSC: 05C70 05C38 05C60 PDFBibTeX XMLCite \textit{S. Milici} and \textit{Z. Tuza}, Discrete Math. 331, 137--141 (2014; Zbl 1296.05166) Full Text: DOI arXiv
Larose, Benoît; Lemaître, Adrien List-homomorphism problems on graphs and arc consistency. (English) Zbl 1281.05069 Discrete Math. 313, No. 22, 2525-2537 (2013). MSC: 05C20 05C70 05C15 PDFBibTeX XMLCite \textit{B. Larose} and \textit{A. Lemaître}, Discrete Math. 313, No. 22, 2525--2537 (2013; Zbl 1281.05069) Full Text: DOI
Feder, Tomás; Hell, Pavol; Nekooei Rizi, Shekoofeh Obstructions to partitions of chordal graphs. (English) Zbl 1277.05137 Discrete Math. 313, No. 19, 1861-1871 (2013). MSC: 05C70 05C60 05C17 68Q17 68Q25 PDFBibTeX XMLCite \textit{T. Feder} et al., Discrete Math. 313, No. 19, 1861--1871 (2013; Zbl 1277.05137) Full Text: DOI
Edwards, Keith J. Achromatic number of collections of paths and cycles. (English) Zbl 1277.05060 Discrete Math. 313, No. 19, 1856-1860 (2013). MSC: 05C15 05C38 PDFBibTeX XMLCite \textit{K. J. Edwards}, Discrete Math. 313, No. 19, 1856--1860 (2013; Zbl 1277.05060) Full Text: DOI
Bonisoli, A.; Ruini, B. Tree-designs with balanced-type conditions. (English) Zbl 1277.05034 Discrete Math. 313, No. 11, 1197-1205 (2013). MSC: 05B30 05C70 PDFBibTeX XMLCite \textit{A. Bonisoli} and \textit{B. Ruini}, Discrete Math. 313, No. 11, 1197--1205 (2013; Zbl 1277.05034) Full Text: DOI
Dourado, Mitre C.; Le, Van Bang; Protti, Fábio; Rautenbach, Dieter; Szwarcfiter, Jayme L. Mixed unit interval graphs. (English) Zbl 1251.05037 Discrete Math. 312, No. 22, 3357-3363 (2012). MSC: 05C10 05C62 PDFBibTeX XMLCite \textit{M. C. Dourado} et al., Discrete Math. 312, No. 22, 3357--3363 (2012; Zbl 1251.05037) Full Text: DOI
Borodin, Oleg V.; Ivanova, Anna O. Acyclic 4-choosability of planar graphs without adjacent short cycles. (English) Zbl 1252.05041 Discrete Math. 312, No. 22, 3335-3341 (2012). MSC: 05C10 05C38 05C15 PDFBibTeX XMLCite \textit{O. V. Borodin} and \textit{A. O. Ivanova}, Discrete Math. 312, No. 22, 3335--3341 (2012; Zbl 1252.05041) Full Text: DOI
Harutyunyan, Hovhannes A.; Liestman, Arthur L. Upper bounds on the broadcast function using minimum dominating sets. (English) Zbl 1252.05161 Discrete Math. 312, No. 20, 2992-2996 (2012). MSC: 05C69 05C35 PDFBibTeX XMLCite \textit{H. A. Harutyunyan} and \textit{A. L. Liestman}, Discrete Math. 312, No. 20, 2992--2996 (2012; Zbl 1252.05161) Full Text: DOI
Steffen, Eckhard Nearly nowhere-zero \(r\)-flow graphs. (English) Zbl 1248.05081 Discrete Math. 312, No. 18, 2757-2759 (2012). MSC: 05C21 PDFBibTeX XMLCite \textit{E. Steffen}, Discrete Math. 312, No. 18, 2757--2759 (2012; Zbl 1248.05081) Full Text: DOI
Fieux, E.; Lacaze, J. Foldings in graphs and relations with simplicial complexes and posets. (English) Zbl 1246.05157 Discrete Math. 312, No. 17, 2639-2651 (2012). MSC: 05C99 57M15 06A06 05E45 PDFBibTeX XMLCite \textit{E. Fieux} and \textit{J. Lacaze}, Discrete Math. 312, No. 17, 2639--2651 (2012; Zbl 1246.05157) Full Text: DOI arXiv
Churchley, Ross; Huang, Jing List monopolar partitions of claw-free graphs. (English) Zbl 1246.05127 Discrete Math. 312, No. 17, 2545-2549 (2012). MSC: 05C70 05C85 PDFBibTeX XMLCite \textit{R. Churchley} and \textit{J. Huang}, Discrete Math. 312, No. 17, 2545--2549 (2012; Zbl 1246.05127) Full Text: DOI
Maróti, M.; Zádori, L. Reflexive digraphs with near unanimity polymorphisms. (English) Zbl 1245.05059 Discrete Math. 312, No. 15, 2316-2328 (2012). MSC: 05C20 05C85 PDFBibTeX XMLCite \textit{M. Maróti} and \textit{L. Zádori}, Discrete Math. 312, No. 15, 2316--2328 (2012; Zbl 1245.05059) Full Text: DOI
Borowiecki, Mieczysław; Drgas-Burchardt, Ewa Acyclic homomorphisms to stars of graph Cartesian products and chordal bipartite graphs. (English) Zbl 1244.05151 Discrete Math. 312, No. 14, 2146-2152 (2012). MSC: 05C60 05C76 05C70 05C12 PDFBibTeX XMLCite \textit{M. Borowiecki} and \textit{E. Drgas-Burchardt}, Discrete Math. 312, No. 14, 2146--2152 (2012; Zbl 1244.05151) Full Text: DOI
Oriolo, Gianpaolo; Pietropaoli, Ugo; Stauffer, Gautier On the recognition of fuzzy circular interval graphs. (English) Zbl 1237.05173 Discrete Math. 312, No. 8, 1426-1435 (2012). MSC: 05C72 05C85 PDFBibTeX XMLCite \textit{G. Oriolo} et al., Discrete Math. 312, No. 8, 1426--1435 (2012; Zbl 1237.05173) Full Text: DOI
LaMar, M. Drew Split digraphs. (English) Zbl 1241.05116 Discrete Math. 312, No. 7, 1314-1325 (2012). MSC: 05C70 05C20 05C07 PDFBibTeX XMLCite \textit{M. D. LaMar}, Discrete Math. 312, No. 7, 1314--1325 (2012; Zbl 1241.05116) Full Text: DOI arXiv Link
Roberson, David E. Häggkvist-Hell graphs: A class of Kneser-colorable graphs. (English) Zbl 1237.05087 Discrete Math. 312, No. 5, 837-853 (2012). MSC: 05C15 05C69 PDFBibTeX XMLCite \textit{D. E. Roberson}, Discrete Math. 312, No. 5, 837--853 (2012; Zbl 1237.05087) Full Text: DOI arXiv
Berardi, Luigia; Gionfriddo, Mario; Rota, Rosaria Balanced and strongly balanced \(P_k\)-designs. (English) Zbl 1236.05019 Discrete Math. 312, No. 3, 633-636 (2012). MSC: 05B05 05C51 PDFBibTeX XMLCite \textit{L. Berardi} et al., Discrete Math. 312, No. 3, 633--636 (2012; Zbl 1236.05019) Full Text: DOI
Brewster, Richard C.; Noel, Jonathan A. Extending precolourings of circular cliques. (English) Zbl 1238.05085 Discrete Math. 312, No. 1, 35-41 (2012). MSC: 05C15 PDFBibTeX XMLCite \textit{R. C. Brewster} and \textit{J. A. Noel}, Discrete Math. 312, No. 1, 35--41 (2012; Zbl 1238.05085) Full Text: DOI
Molloy, Michael; Thron, Giovanna The adaptable choosability number grows with the choosability number. (English) Zbl 1250.05049 Discrete Math. 311, No. 20, 2268-2271 (2011). Reviewer: Ulrike Baumann (Dresden) MSC: 05C15 05C78 PDFBibTeX XMLCite \textit{M. Molloy} and \textit{G. Thron}, Discrete Math. 311, No. 20, 2268--2271 (2011; Zbl 1250.05049) Full Text: DOI
Kyaw, Aung Spanning trees with at most \(k\) leaves in \(K_{1,4}\)-free graphs. (English) Zbl 1235.05033 Discrete Math. 311, No. 20, 2135-2142 (2011). MSC: 05C05 05C38 PDFBibTeX XMLCite \textit{A. Kyaw}, Discrete Math. 311, No. 20, 2135--2142 (2011; Zbl 1235.05033) Full Text: DOI
Gimbel, John; Nešetřil, Jaroslav Partitions of graphs into cographs. (English) Zbl 1209.05181 Discrete Math. 310, No. 24, 3437-3445 (2010). Reviewer: Van Bang Le (Rostock) MSC: 05C70 05C76 05C85 PDFBibTeX XMLCite \textit{J. Gimbel} and \textit{J. Nešetřil}, Discrete Math. 310, No. 24, 3437--3445 (2010; Zbl 1209.05181) Full Text: DOI
Borodin, O. V.; Ivanova, A. O.; Raspaud, A. Acyclic 4-choosability of planar graphs with neither 4-cycles nor triangular 6-cycles. (English) Zbl 1209.05063 Discrete Math. 310, No. 21, 2946-2950 (2010). MSC: 05C10 05C15 PDFBibTeX XMLCite \textit{O. V. Borodin} et al., Discrete Math. 310, No. 21, 2946--2950 (2010; Zbl 1209.05063) Full Text: DOI
Goldstone, Richard; Weld, Kathryn Graphically abelian groups. (English) Zbl 1209.05121 Discrete Math. 310, No. 21, 2806-2810 (2010). MSC: 05C25 PDFBibTeX XMLCite \textit{R. Goldstone} and \textit{K. Weld}, Discrete Math. 310, No. 21, 2806--2810 (2010; Zbl 1209.05121) Full Text: DOI
Albertson, Michael O.; Boutin, Debra L.; Gethner, Ellen The thickness and chromatic number of \(r\)-inflated graphs. (English) Zbl 1221.05123 Discrete Math. 310, No. 20, 2725-2734 (2010). MSC: 05C15 PDFBibTeX XMLCite \textit{M. O. Albertson} et al., Discrete Math. 310, No. 20, 2725--2734 (2010; Zbl 1221.05123) Full Text: DOI
MacGillivray, Gary; Swarts, Jacobus The complexity of locally injective homomorphisms. (English) Zbl 1219.05062 Discrete Math. 310, No. 20, 2685-2696 (2010). MSC: 05C20 05C60 05C15 PDFBibTeX XMLCite \textit{G. MacGillivray} and \textit{J. Swarts}, Discrete Math. 310, No. 20, 2685--2696 (2010; Zbl 1219.05062) Full Text: DOI
Bang-Jensen, Jørgen; MacGillivray, Gary; Swarts, Jacobus The complexity of colouring by locally semicomplete digraphs. (English) Zbl 1221.05173 Discrete Math. 310, No. 20, 2675-2684 (2010). MSC: 05C20 05C15 05C60 PDFBibTeX XMLCite \textit{J. Bang-Jensen} et al., Discrete Math. 310, No. 20, 2675--2684 (2010; Zbl 1221.05173) Full Text: DOI
Borodin, O. V.; Chen, Min; Ivanova, Anna O.; Raspaud, A. Acyclic 3-choosability of sparse graphs with girth at least 7. (English) Zbl 1213.05049 Discrete Math. 310, No. 17-18, 2426-2434 (2010). MSC: 05C10 05C15 PDFBibTeX XMLCite \textit{O. V. Borodin} et al., Discrete Math. 310, No. 17--18, 2426--2434 (2010; Zbl 1213.05049) Full Text: DOI
Horvat, Boris; Pisanski, Tomaž Products of unit distance graphs. (English) Zbl 1223.05256 Discrete Math. 310, No. 12, 1783-1792 (2010). MSC: 05C76 05C62 05C10 05C12 PDFBibTeX XMLCite \textit{B. Horvat} and \textit{T. Pisanski}, Discrete Math. 310, No. 12, 1783--1792 (2010; Zbl 1223.05256) Full Text: DOI
Hammack, Richard H. A quasicancellation property for the direct product of graphs. (English) Zbl 1222.05224 Discrete Math. 310, No. 12, 1691-1696 (2010). MSC: 05C76 PDFBibTeX XMLCite \textit{R. H. Hammack}, Discrete Math. 310, No. 12, 1691--1696 (2010; Zbl 1222.05224) Full Text: DOI
Loten, Cynthia Absolute retracts and varieties generated by chordal graphs. (English) Zbl 1219.05156 Discrete Math. 310, No. 10-11, 1507-1519 (2010). MSC: 05C75 PDFBibTeX XMLCite \textit{C. Loten}, Discrete Math. 310, No. 10--11, 1507--1519 (2010; Zbl 1219.05156) Full Text: DOI
Johnson, Matthew; Paulusma, Daniël; Wood, Chantal Path factors and parallel knock-out schemes of almost claw-free graphs. (English) Zbl 1219.05140 Discrete Math. 310, No. 9, 1413-1423 (2010). MSC: 05C70 05C38 05C35 PDFBibTeX XMLCite \textit{M. Johnson} et al., Discrete Math. 310, No. 9, 1413--1423 (2010; Zbl 1219.05140) Full Text: DOI Link
Cook, Kathryn; Dantas, Simone; Eschen, Elaine M.; Faria, Luerbio; de Figueiredo, Celina M. H.; Klein, Sulamita \(2K_{2}\) vertex-set partition into nonempty parts. (English) Zbl 1230.05233 Discrete Math. 310, No. 6-7, 1259-1264 (2010). MSC: 05C70 05A18 05C85 68Q17 PDFBibTeX XMLCite \textit{K. Cook} et al., Discrete Math. 310, No. 6--7, 1259--1264 (2010; Zbl 1230.05233) Full Text: DOI
Kaschek, Roland On wreathed lexicographic products of graphs. (English) Zbl 1195.05064 Discrete Math. 310, No. 8, 1275-1281 (2010). MSC: 05C76 PDFBibTeX XMLCite \textit{R. Kaschek}, Discrete Math. 310, No. 8, 1275--1281 (2010; Zbl 1195.05064) Full Text: DOI
Dourado, Mitre C.; Protti, Fábio; Rautenbach, Dieter; Szwarcfiter, Jayme L. Some remarks on the geodetic number of a graph. (English) Zbl 1209.05129 Discrete Math. 310, No. 4, 832-837 (2010). MSC: 05C38 05C35 PDFBibTeX XMLCite \textit{M. C. Dourado} et al., Discrete Math. 310, No. 4, 832--837 (2010; Zbl 1209.05129) Full Text: DOI Link
Cameron, Peter J.; Lockett, Deborah C. Posets, homomorphisms and homogeneity. (English) Zbl 1223.05112 Discrete Math. 310, No. 3, 604-613 (2010). MSC: 05C25 06A06 PDFBibTeX XMLCite \textit{P. J. Cameron} and \textit{D. C. Lockett}, Discrete Math. 310, No. 3, 604--613 (2010; Zbl 1223.05112) Full Text: DOI
Berke, Robert; Mitsche, Dieter Colorings at minimum cost. (English) Zbl 1236.05076 Discrete Math. 310, No. 3, 561-569 (2010). MSC: 05C15 05C85 05C78 PDFBibTeX XMLCite \textit{R. Berke} and \textit{D. Mitsche}, Discrete Math. 310, No. 3, 561--569 (2010; Zbl 1236.05076) Full Text: DOI
Bonato, Anthony; Delić, Dejan; Dolinka, Igor All countable monoids embed into the monoid of the infinite random graph. (English) Zbl 1194.05142 Discrete Math. 310, No. 3, 373-375 (2010). Reviewer: Ulrich Knauer (Oldenburg) MSC: 05C80 20M20 PDFBibTeX XMLCite \textit{A. Bonato} et al., Discrete Math. 310, No. 3, 373--375 (2010; Zbl 1194.05142) Full Text: DOI
Alishahi, Meysam; Hajiabolhassan, Hossein; Taherkhani, Ali A generalization of the Erdős-Ko-Rado theorem. (English) Zbl 1181.05033 Discrete Math. 310, No. 1, 188-191 (2010). MSC: 05C15 05C69 05C35 PDFBibTeX XMLCite \textit{M. Alishahi} et al., Discrete Math. 310, No. 1, 188--191 (2010; Zbl 1181.05033) Full Text: DOI arXiv
Lonc, Zbigniew; Pszczoła, Monika Edge decompositions into two kinds of graphs. (English) Zbl 1210.05111 Discrete Math. 309, No. 22, 6368-6374 (2009). MSC: 05C70 05C85 PDFBibTeX XMLCite \textit{Z. Lonc} and \textit{M. Pszczoła}, Discrete Math. 309, No. 22, 6368--6374 (2009; Zbl 1210.05111) Full Text: DOI
Ekim, Tınaz; Gimbel, John Partitioning graphs into complete and empty graphs. (English) Zbl 1186.05095 Discrete Math. 309, No. 19, 5849-5856 (2009). MSC: 05C70 PDFBibTeX XMLCite \textit{T. Ekim} and \textit{J. Gimbel}, Discrete Math. 309, No. 19, 5849--5856 (2009; Zbl 1186.05095) Full Text: DOI
Guan, Albert; Zhu, Xuding Adaptable choosability of planar graphs with sparse short cycles. (English) Zbl 1198.05048 Discrete Math. 309, No. 20, 6044-6047 (2009). MSC: 05C15 05C38 05C78 PDFBibTeX XMLCite \textit{A. Guan} and \textit{X. Zhu}, Discrete Math. 309, No. 20, 6044--6047 (2009; Zbl 1198.05048) Full Text: DOI
Naserasr, Reza; Nigussie, Yared; Škrekovski, Riste Homomorphisms of triangle-free graphs without a \(K_{5}\)-minor. (English) Zbl 1210.05084 Discrete Math. 309, No. 18, 5789-5798 (2009). MSC: 05C60 05C35 05C15 PDFBibTeX XMLCite \textit{R. Naserasr} et al., Discrete Math. 309, No. 18, 5789--5798 (2009; Zbl 1210.05084) Full Text: DOI
Adams, Peter; Ardal, Hayri; Maňuch, Ján; Hòa, Vũ Dình; Rosenfeld, Moshe; Stacho, Ladislav Spanning cubic graph designs. (English) Zbl 1186.05022 Discrete Math. 309, No. 18, 5781-5788 (2009). MSC: 05B05 05C70 PDFBibTeX XMLCite \textit{P. Adams} et al., Discrete Math. 309, No. 18, 5781--5788 (2009; Zbl 1186.05022) Full Text: DOI
Cameron, Kathie Brambles and independent packings in chordal graphs. (English) Zbl 1218.05110 Discrete Math. 309, No. 18, 5766-5769 (2009). MSC: 05C69 05C70 PDFBibTeX XMLCite \textit{K. Cameron}, Discrete Math. 309, No. 18, 5766--5769 (2009; Zbl 1218.05110) Full Text: DOI
Brewster, Richard C.; MacGillivray, Gary; Shepherd, Laura The circular chromatic number of hypergraphs. (English) Zbl 1213.05067 Discrete Math. 309, No. 18, 5757-5765 (2009). MSC: 05C15 05C65 PDFBibTeX XMLCite \textit{R. C. Brewster} et al., Discrete Math. 309, No. 18, 5757--5765 (2009; Zbl 1213.05067) Full Text: DOI
MacGillivray, G.; Siggers, M. On the complexity of \(H\)-colouring planar graphs. (English) Zbl 1213.05094 Discrete Math. 309, No. 18, 5729-5738 (2009). MSC: 05C15 05C10 05C38 05C85 68Q25 PDFBibTeX XMLCite \textit{G. MacGillivray} and \textit{M. Siggers}, Discrete Math. 309, No. 18, 5729--5738 (2009; Zbl 1213.05094) Full Text: DOI
Hell, Pavol; Kirkpatrick, David Linear-time certifying algorithms for near-graphical sequences. (English) Zbl 1185.05135 Discrete Math. 309, No. 18, 5703-5713 (2009). MSC: 05C85 05C70 05C07 68R10 PDFBibTeX XMLCite \textit{P. Hell} and \textit{D. Kirkpatrick}, Discrete Math. 309, No. 18, 5703--5713 (2009; Zbl 1185.05135) Full Text: DOI
Morgan, David A dynamic distributed approach to representing proper interval graphs. (English) Zbl 1210.05085 Discrete Math. 309, No. 18, 5697-5702 (2009). MSC: 05C62 PDFBibTeX XMLCite \textit{D. Morgan}, Discrete Math. 309, No. 18, 5697--5702 (2009; Zbl 1210.05085) Full Text: DOI
Dourado, Mitre C.; Gimbel, John G.; Kratochvíl, Jan; Protti, Fábio; Szwarcfiter, Jayme L. On the computation of the hull number of a graph. (English) Zbl 1215.05184 Discrete Math. 309, No. 18, 5668-5674 (2009). MSC: 05C85 PDFBibTeX XMLCite \textit{M. C. Dourado} et al., Discrete Math. 309, No. 18, 5668--5674 (2009; Zbl 1215.05184) Full Text: DOI
Bang-Jensen, Jørgen Problems and conjectures concerning connectivity, paths, trees and cycles in tournament-like digraphs. (English) Zbl 1207.05067 Discrete Math. 309, No. 18, 5655-5667 (2009). MSC: 05C20 05C40 05C38 05C05 PDFBibTeX XMLCite \textit{J. Bang-Jensen}, Discrete Math. 309, No. 18, 5655--5667 (2009; Zbl 1207.05067) Full Text: DOI
Lin, Min Chih; Szwarcfiter, Jayme L. Characterizations and recognition of circular-arc graphs and subclasses: a survey. (English) Zbl 1228.05218 Discrete Math. 309, No. 18, 5618-5635 (2009). MSC: 05C62 05C38 05C85 05-02 PDFBibTeX XMLCite \textit{M. C. Lin} and \textit{J. L. Szwarcfiter}, Discrete Math. 309, No. 18, 5618--5635 (2009; Zbl 1228.05218) Full Text: DOI