Cararo, Cintia Izabel; Morais de Almeida, Sheila; Nunes da Silva, Cândida Further split graphs known to be class 1 and a characterization of subgraph-overfull split graphs. (English) Zbl 07785860 Discrete Appl. Math. 345, 114-124 (2024). MSC: 05C15 05B15 68Q25 PDFBibTeX XMLCite \textit{C. I. Cararo} et al., Discrete Appl. Math. 345, 114--124 (2024; Zbl 07785860) Full Text: DOI
Zhao, Lina; Wang, Shiying Structure connectivity and substructure connectivity of split-star networks. (English) Zbl 1526.05082 Discrete Appl. Math. 341, 359-371 (2023). MSC: 05C40 05C82 90B10 PDFBibTeX XMLCite \textit{L. Zhao} and \textit{S. Wang}, Discrete Appl. Math. 341, 359--371 (2023; Zbl 1526.05082) Full Text: DOI
da Soledade Gonzaga, Luis Gustavo; Bismarck de Sousa Cruz, Jadder; Morais de Almeida, Sheila; Nunes da Silva, Cândida The overfull conjecture on split-comparability and split-interval graphs. (English) Zbl 1527.05064 Discrete Appl. Math. 340, 228-238 (2023). Reviewer: Carl Casselgren (Linköping) MSC: 05C15 05C75 05C85 PDFBibTeX XMLCite \textit{L. G. da Soledade Gonzaga} et al., Discrete Appl. Math. 340, 228--238 (2023; Zbl 1527.05064) Full Text: DOI
Chen, Xiaodong; Liu, Qinghai; Yang, Xiwu Two completely independent spanning trees of split graphs. (English) Zbl 1521.05092 Discrete Appl. Math. 340, 76-78 (2023). MSC: 05C45 05C05 PDFBibTeX XMLCite \textit{X. Chen} et al., Discrete Appl. Math. 340, 76--78 (2023; Zbl 1521.05092) Full Text: DOI
Lyu, Bochuan; Hicks, Illya V. Finding biclique partitions of co-chordal graphs. (English) Zbl 1516.05188 Discrete Appl. Math. 337, 278-287 (2023). MSC: 05C70 05C75 PDFBibTeX XMLCite \textit{B. Lyu} and \textit{I. V. Hicks}, Discrete Appl. Math. 337, 278--287 (2023; Zbl 1516.05188) Full Text: DOI arXiv
Groshaus, M.; Guedes, A. L. P.; Puppo, J. P. Biclique graphs of split graphs. (English) Zbl 1502.05106 Discrete Appl. Math. 323, 252-267 (2022). MSC: 05C38 05C45 68Q25 PDFBibTeX XMLCite \textit{M. Groshaus} et al., Discrete Appl. Math. 323, 252--267 (2022; Zbl 1502.05106) Full Text: DOI
Francis, Mathew C.; Medeiros, Lívia S.; Oliveira, Fabiano S.; Szwarcfiter, Jayme L. On subclasses of interval count two and on Fishburn’s conjecture. (English) Zbl 1502.05099 Discrete Appl. Math. 323, 236-251 (2022). MSC: 05C35 05C17 05C75 PDFBibTeX XMLCite \textit{M. C. Francis} et al., Discrete Appl. Math. 323, 236--251 (2022; Zbl 1502.05099) Full Text: DOI
Bonomo-Braberman, Flavia; Durán, Guillermo; Pardal, Nina; Safe, Martín D. Forbidden induced subgraph characterization of circle graphs within split graphs. (English) Zbl 1502.05168 Discrete Appl. Math. 323, 43-75 (2022). MSC: 05C60 05C35 PDFBibTeX XMLCite \textit{F. Bonomo-Braberman} et al., Discrete Appl. Math. 323, 43--75 (2022; Zbl 1502.05168) Full Text: DOI arXiv
Fukuzono, Naoka; Hanaka, Tesshu; Kiya, Hironori; Ono, Hirotaka The existence of a pure Nash equilibrium in the two-player competitive diffusion game on graphs having chordality. (English) Zbl 1498.91089 Discrete Appl. Math. 321, 281-294 (2022). MSC: 91A43 05C57 91D30 PDFBibTeX XMLCite \textit{N. Fukuzono} et al., Discrete Appl. Math. 321, 281--294 (2022; Zbl 1498.91089) Full Text: DOI
Bhore, Sujoy; Chakraborty, Sourav; Jana, Satyabrata; Mitchell, Joseph S. B.; Pandit, Supantha; Roy, Sasanka The balanced connected subgraph problem. (English) Zbl 1494.05027 Discrete Appl. Math. 319, 111-120 (2022). MSC: 05C10 05C40 05C60 05C15 68Q17 PDFBibTeX XMLCite \textit{S. Bhore} et al., Discrete Appl. Math. 319, 111--120 (2022; Zbl 1494.05027) Full Text: DOI arXiv
Hellmuth, Marc; Schaller, David; Stadler, Peter F. Compatibility of partitions with trees, hierarchies, and split systems. (English) Zbl 1486.05243 Discrete Appl. Math. 314, 265-283 (2022). MSC: 05C70 05C05 05C90 92D15 PDFBibTeX XMLCite \textit{M. Hellmuth} et al., Discrete Appl. Math. 314, 265--283 (2022; Zbl 1486.05243) Full Text: DOI arXiv
Jones, Átila A.; Protti, Fábio; Del-Vecchio, Renata R. Edge clique partition in \((k,\ell)\)-graphs. (English) Zbl 1477.05143 Discrete Appl. Math. 306, 89-97 (2022). MSC: 05C70 68Q17 05C69 PDFBibTeX XMLCite \textit{Á. A. Jones} et al., Discrete Appl. Math. 306, 89--97 (2022; Zbl 1477.05143) Full Text: DOI
Ducoffe, Guillaume; Popa, Alexandru The \(b\)-Matching problem in distance-hereditary graphs and beyond. (English) Zbl 1476.05166 Discrete Appl. Math. 305, 233-246 (2021). MSC: 05C70 68Q25 90C39 PDFBibTeX XMLCite \textit{G. Ducoffe} and \textit{A. Popa}, Discrete Appl. Math. 305, 233--246 (2021; Zbl 1476.05166) Full Text: DOI
Krithika, R.; Rai, Ashutosh; Saurabh, Saket; Tale, Prafullkumar Parameterized and exact algorithms for class domination coloring. (English) Zbl 1509.68204 Discrete Appl. Math. 291, 286-299 (2021). MSC: 68R10 05C15 05C69 05C85 68Q17 68Q27 PDFBibTeX XMLCite \textit{R. Krithika} et al., Discrete Appl. Math. 291, 286--299 (2021; Zbl 1509.68204) Full Text: DOI
Konstantinidis, Athanasios L.; Papadopoulos, Charis Maximizing the strong triadic closure in split graphs and proper interval graphs. (English) Zbl 1446.05080 Discrete Appl. Math. 285, 79-95 (2020). MSC: 05C78 05C75 05C85 68Q17 91D30 PDFBibTeX XMLCite \textit{A. L. Konstantinidis} and \textit{C. Papadopoulos}, Discrete Appl. Math. 285, 79--95 (2020; Zbl 1446.05080) Full Text: DOI arXiv Link
Nasini, Graciela; Torres, Pablo Grundy dominating sequences on \(X\)-join product. (English) Zbl 1443.05151 Discrete Appl. Math. 284, 138-149 (2020). MSC: 05C69 05C38 PDFBibTeX XMLCite \textit{G. Nasini} and \textit{P. Torres}, Discrete Appl. Math. 284, 138--149 (2020; Zbl 1443.05151) Full Text: DOI arXiv
Matamala, Martín; Zamora, José Graphs admitting antimagic labeling for arbitrary sets of positive numbers. (English) Zbl 1440.05177 Discrete Appl. Math. 281, 246-251 (2020). MSC: 05C78 PDFBibTeX XMLCite \textit{M. Matamala} and \textit{J. Zamora}, Discrete Appl. Math. 281, 246--251 (2020; Zbl 1440.05177) Full Text: DOI
Renjith, P.; Sadagopan, N. The Steiner tree in \(K_{1,r}\)-free split graphs – a dichotomy. (English) Zbl 1439.05053 Discrete Appl. Math. 280, 246-255 (2020). MSC: 05C05 05C40 68Q25 PDFBibTeX XMLCite \textit{P. Renjith} and \textit{N. Sadagopan}, Discrete Appl. Math. 280, 246--255 (2020; Zbl 1439.05053) Full Text: DOI
Shalu, M. A.; Vijayakumar, S.; Sandhya, T. P. On the complexity of cd-coloring of graphs. (English) Zbl 1439.05093 Discrete Appl. Math. 280, 171-185 (2020). MSC: 05C15 05C69 PDFBibTeX XMLCite \textit{M. A. Shalu} et al., Discrete Appl. Math. 280, 171--185 (2020; Zbl 1439.05093) Full Text: DOI
Courcelle, Bruno Grammars and clique-width bounds from split decompositions. (English) Zbl 1437.05193 Discrete Appl. Math. 278, 93-117 (2020). MSC: 05C70 05C20 05C85 PDFBibTeX XMLCite \textit{B. Courcelle}, Discrete Appl. Math. 278, 93--117 (2020; Zbl 1437.05193) Full Text: DOI HAL
Goldberg, Felix; Kirkland, Steve; Varghese, Anu; Vijayakumar, Ambat On split graphs with four distinct eigenvalues. (English) Zbl 1435.05128 Discrete Appl. Math. 277, 163-171 (2020). MSC: 05C50 05C12 05C35 PDFBibTeX XMLCite \textit{F. Goldberg} et al., Discrete Appl. Math. 277, 163--171 (2020; Zbl 1435.05128) Full Text: DOI arXiv Backlinks: MO
Bertazzi, Luca; Golden, Bruce; Wang, Xingyin The bin packing problem with item fragmentation: a worst-case analysis. (English) Zbl 1420.90057 Discrete Appl. Math. 261, 63-77 (2019). MSC: 90C27 90C60 PDFBibTeX XMLCite \textit{L. Bertazzi} et al., Discrete Appl. Math. 261, 63--77 (2019; Zbl 1420.90057) Full Text: DOI
Eiben, Eduard; Ganian, Robert; Szeider, Stefan Meta-kernelization using well-structured modulators. (English) Zbl 1396.68055 Discrete Appl. Math. 248, 153-167 (2018). MSC: 68Q25 68W05 PDFBibTeX XMLCite \textit{E. Eiben} et al., Discrete Appl. Math. 248, 153--167 (2018; Zbl 1396.68055) Full Text: DOI arXiv Link
Mengel, Stefan Lower bounds on the mim-width of some graph classes. (English) Zbl 1395.05172 Discrete Appl. Math. 248, 28-32 (2018). MSC: 05C85 PDFBibTeX XMLCite \textit{S. Mengel}, Discrete Appl. Math. 248, 28--32 (2018; Zbl 1395.05172) Full Text: DOI arXiv
Brešar, Boštjan; Movarraei, Nazanin On the number of maximal independent sets in minimum colorings of split graphs. (English) Zbl 1394.05057 Discrete Appl. Math. 247, 352-356 (2018). MSC: 05C30 05C69 05C15 PDFBibTeX XMLCite \textit{B. Brešar} and \textit{N. Movarraei}, Discrete Appl. Math. 247, 352--356 (2018; Zbl 1394.05057) Full Text: DOI
Sciriha, Irene; Briffa, Johann A.; Debono, Mark Fast algorithms for indices of nested split graphs approximating real complex networks. (English) Zbl 1394.05125 Discrete Appl. Math. 247, 152-164 (2018). MSC: 05C85 05C90 05C12 05C07 05C50 PDFBibTeX XMLCite \textit{I. Sciriha} et al., Discrete Appl. Math. 247, 152--164 (2018; Zbl 1394.05125) Full Text: DOI arXiv
McKee, Terry A. Strict chordal digraphs viewed as graphs with distinguished edges. (English) Zbl 1394.05039 Discrete Appl. Math. 247, 122-126 (2018). MSC: 05C20 05C69 PDFBibTeX XMLCite \textit{T. A. McKee}, Discrete Appl. Math. 247, 122--126 (2018; Zbl 1394.05039) Full Text: DOI
Bonomo, Flavia; Brešar, Boštjan; Grippo, Luciano N.; Milanič, Martin; Safe, Martín D. Domination parameters with number 2: interrelations and algorithmic consequences. (English) Zbl 1375.05193 Discrete Appl. Math. 235, 23-50 (2018). MSC: 05C69 PDFBibTeX XMLCite \textit{F. Bonomo} et al., Discrete Appl. Math. 235, 23--50 (2018; Zbl 1375.05193) Full Text: DOI arXiv Link
Sæther, Sigve Hortemo Solving Hamiltonian cycle by an EPT algorithm for a non-sparse parameter. (English) Zbl 1365.05165 Discrete Appl. Math. 228, 88-97 (2017). MSC: 05C45 05C38 05C85 68W25 PDFBibTeX XMLCite \textit{S. H. Sæther}, Discrete Appl. Math. 228, 88--97 (2017; Zbl 1365.05165) Full Text: DOI arXiv
Hell, Pavol; Hernández-Cruz, César Strict chordal and strict split digraphs. (English) Zbl 1358.05125 Discrete Appl. Math. 216, Part 3, 609-617 (2017). MSC: 05C20 05C85 PDFBibTeX XMLCite \textit{P. Hell} and \textit{C. Hernández-Cruz}, Discrete Appl. Math. 216, Part 3, 609--617 (2017; Zbl 1358.05125) Full Text: DOI
Moravcik, Gaia; Oellermann, Ortrud R.; Yusim, Samuel Comparing the metric and strong dimensions of graphs. (English) Zbl 1355.05100 Discrete Appl. Math. 220, 68-79 (2017). MSC: 05C12 PDFBibTeX XMLCite \textit{G. Moravcik} et al., Discrete Appl. Math. 220, 68--79 (2017; Zbl 1355.05100) Full Text: DOI
Chandran, L. Sunil; Rajendraprasad, Deepak; Tesař, Marek Rainbow colouring of split graphs. (English) Zbl 1350.05029 Discrete Appl. Math. 216, Part 1, 98-113 (2017). MSC: 05C15 05C40 68Q17 PDFBibTeX XMLCite \textit{L. S. Chandran} et al., Discrete Appl. Math. 216, Part 1, 98--113 (2017; Zbl 1350.05029) Full Text: DOI arXiv
Boros, Endre; Gurvich, Vladimir; Milanič, Martin On equistable, split, CIS, and related classes of graphs. (English) Zbl 1350.05117 Discrete Appl. Math. 216, Part 1, 47-66 (2017). MSC: 05C69 05C70 05C76 PDFBibTeX XMLCite \textit{E. Boros} et al., Discrete Appl. Math. 216, Part 1, 47--66 (2017; Zbl 1350.05117) Full Text: DOI arXiv
Brandstädt, Andreas; Dabrowski, Konrad K.; Huang, Shenwei; Paulusma, Daniël Bounding the clique-width of \(H\)-free split graphs. (English) Zbl 1348.05147 Discrete Appl. Math. 211, 30-39 (2016). MSC: 05C69 05C17 05C12 05C75 PDFBibTeX XMLCite \textit{A. Brandstädt} et al., Discrete Appl. Math. 211, 30--39 (2016; Zbl 1348.05147) Full Text: DOI
Cameron, Kathie; Chaplick, Steven; Hoàng, Chính T. Edge intersection graphs of \(L\)-shaped paths in grids. (English) Zbl 1339.05381 Discrete Appl. Math. 210, 185-194 (2016). MSC: 05C85 68Q17 68Q25 PDFBibTeX XMLCite \textit{K. Cameron} et al., Discrete Appl. Math. 210, 185--194 (2016; Zbl 1339.05381) Full Text: DOI arXiv
Das, Kinkar Ch.; Liu, Muhuo Complete split graph determined by its (signless) Laplacian spectrum. (English) Zbl 1333.05180 Discrete Appl. Math. 205, 45-51 (2016). MSC: 05C50 PDFBibTeX XMLCite \textit{K. Ch. Das} and \textit{M. Liu}, Discrete Appl. Math. 205, 45--51 (2016; Zbl 1333.05180) Full Text: DOI
Brignall, Robert; Lozin, Vadim V.; Stacho, Juraj Bichain graphs: geometric model and universal graphs. (English) Zbl 1326.05119 Discrete Appl. Math. 199, 16-29 (2016). MSC: 05C70 PDFBibTeX XMLCite \textit{R. Brignall} et al., Discrete Appl. Math. 199, 16--29 (2016; Zbl 1326.05119) Full Text: DOI
Diwan, Ajit; Pal, Soumitra; Ranade, Abhiram Fragmented coloring of proper interval and split graphs. (English) Zbl 1316.05042 Discrete Appl. Math. 193, 110-118 (2015). MSC: 05C15 PDFBibTeX XMLCite \textit{A. Diwan} et al., Discrete Appl. Math. 193, 110--118 (2015; Zbl 1316.05042) Full Text: DOI
Johnson, Matthew; Paulusma, Daniël; Stewart, Anthony Knocking out \(P_k\)-free graphs. (English) Zbl 1316.05082 Discrete Appl. Math. 190-191, 100-108 (2015). MSC: 05C45 68Q17 PDFBibTeX XMLCite \textit{M. Johnson} et al., Discrete Appl. Math. 190--191, 100--108 (2015; Zbl 1316.05082) Full Text: DOI
Ghorbani, Modjtaba; Azimi, Nasrin Characterization of split graphs with at most four distinct eigenvalues. (English) Zbl 1311.05112 Discrete Appl. Math. 184, 231-236 (2015). MSC: 05C50 05C31 PDFBibTeX XMLCite \textit{M. Ghorbani} and \textit{N. Azimi}, Discrete Appl. Math. 184, 231--236 (2015; Zbl 1311.05112) Full Text: DOI
Eschen, Elaine M.; Wang, Xiaoqiang Algorithms for unipolar and generalized split graphs. (English) Zbl 1300.05251 Discrete Appl. Math. 162, 195-201 (2014). MSC: 05C70 05C17 05C69 05C85 68Q17 PDFBibTeX XMLCite \textit{E. M. Eschen} and \textit{X. Wang}, Discrete Appl. Math. 162, 195--201 (2014; Zbl 1300.05251) Full Text: DOI
Petrosyan, P. A.; Kamalian, R. R. On sum edge-coloring of regular, bipartite and split graphs. (English) Zbl 1288.05100 Discrete Appl. Math. 165, 263-269 (2014). MSC: 05C15 05C70 68Q17 PDFBibTeX XMLCite \textit{P. A. Petrosyan} and \textit{R. R. Kamalian}, Discrete Appl. Math. 165, 263--269 (2014; Zbl 1288.05100) Full Text: DOI arXiv
Golumbic, Martin Charles; Weingarten, Nirit Lefel; Limouzy, Vincent Co-TT graphs and a characterization of split co-TT graphs. (English) Zbl 1408.05112 Discrete Appl. Math. 165, 168-174 (2014). MSC: 05C75 05C62 05C85 68Q25 PDFBibTeX XMLCite \textit{M. C. Golumbic} et al., Discrete Appl. Math. 165, 168--174 (2014; Zbl 1408.05112) Full Text: DOI
Feder, Tomás; Hell, Pavol; Shklarsky, Oren Matrix partitions of split graphs. (English) Zbl 1283.05213 Discrete Appl. Math. 166, 91-96 (2014). MSC: 05C70 05C15 05C50 05C60 PDFBibTeX XMLCite \textit{T. Feder} et al., Discrete Appl. Math. 166, 91--96 (2014; Zbl 1283.05213) Full Text: DOI arXiv
Milanič, Martin; Schaudt, Oliver Computing square roots of trivially perfect and threshold graphs. (English) Zbl 1287.05095 Discrete Appl. Math. 161, No. 10-11, 1538-1545 (2013). MSC: 05C62 05C85 68Q25 PDFBibTeX XMLCite \textit{M. Milanič} and \textit{O. Schaudt}, Discrete Appl. Math. 161, No. 10--11, 1538--1545 (2013; Zbl 1287.05095) Full Text: DOI
Lan, James K.; Chang, Gerard Jennhwa Algorithmic aspects of the \(k\)-domination problem in graphs. (English) Zbl 1287.05103 Discrete Appl. Math. 161, No. 10-11, 1513-1520 (2013). MSC: 05C69 05C05 05C85 68Q17 68Q25 PDFBibTeX XMLCite \textit{J. K. Lan} and \textit{G. J. Chang}, Discrete Appl. Math. 161, No. 10--11, 1513--1520 (2013; Zbl 1287.05103) Full Text: DOI
Dress, Andreas; Moulton, Vincent; Spillner, Andreas; Wu, Taoyang Obtaining splits from cut sets of tight spans. (English) Zbl 1295.05245 Discrete Appl. Math. 161, No. 10-11, 1409-1420 (2013). Reviewer: Hans Peter Künzi (Rondebosch) MSC: 05C90 54E35 92D15 90C90 PDFBibTeX XMLCite \textit{A. Dress} et al., Discrete Appl. Math. 161, No. 10--11, 1409--1420 (2013; Zbl 1295.05245) Full Text: DOI
Di Stefano, Gabriele Distance-hereditary comparability graphs. (English) Zbl 1254.05155 Discrete Appl. Math. 160, No. 18, 2669-2680 (2012). MSC: 05C70 05C12 05C85 PDFBibTeX XMLCite \textit{G. Di Stefano}, Discrete Appl. Math. 160, No. 18, 2669--2680 (2012; Zbl 1254.05155) Full Text: DOI
Cerioli, Márcia R.; Posner, Daniel F. D. On \(L(2,1)\)-coloring split, chordal bipartite, and weakly chordal graphs. (English) Zbl 1257.05039 Discrete Appl. Math. 160, No. 18, 2655-2661 (2012). Reviewer: Peter Horák (Tacoma) MSC: 05C15 PDFBibTeX XMLCite \textit{M. R. Cerioli} and \textit{D. F. D. Posner}, Discrete Appl. Math. 160, No. 18, 2655--2661 (2012; Zbl 1257.05039) Full Text: DOI
Papadopoulos, Charis Restricted vertex multicut on permutation graphs. (English) Zbl 1246.05153 Discrete Appl. Math. 160, No. 12, 1791-1797 (2012). MSC: 05C85 90C35 PDFBibTeX XMLCite \textit{C. Papadopoulos}, Discrete Appl. Math. 160, No. 12, 1791--1797 (2012; Zbl 1246.05153) Full Text: DOI
Gioan, Emeric; Paul, Christophe Split decomposition and graph-labelled trees: characterizations and fully dynamic algorithms for totally decomposable graphs. (English) Zbl 1236.05162 Discrete Appl. Math. 160, No. 6, 708-733 (2012). MSC: 05C70 05C78 05C05 05C12 PDFBibTeX XMLCite \textit{E. Gioan} and \textit{C. Paul}, Discrete Appl. Math. 160, No. 6, 708--733 (2012; Zbl 1236.05162) Full Text: DOI
Anđelić, Milica; da Fonseca, Carlos M.; Simić, Slobodan K.; Tošić, Dejan V. Connected graphs of fixed order and size with maximal \(Q\)-index: some spectral bounds. (English) Zbl 1239.05115 Discrete Appl. Math. 160, No. 4-5, 448-459 (2012). MSC: 05C50 05C40 05C75 PDFBibTeX XMLCite \textit{M. Anđelić} et al., Discrete Appl. Math. 160, No. 4--5, 448--459 (2012; Zbl 1239.05115) Full Text: DOI
Shuchat, Alan; Shull, Randy; Trenk, Ann N. Fractional weak discrepancy and split semiorders. (English) Zbl 1256.06002 Discrete Appl. Math. 159, No. 7, 647-660 (2011). MSC: 06A07 PDFBibTeX XMLCite \textit{A. Shuchat} et al., Discrete Appl. Math. 159, No. 7, 647--660 (2011; Zbl 1256.06002) Full Text: DOI arXiv Link
Brešar, Boštjan; Changat, Manoj; Gologranc, Tanja; Mathews, Joseph; Mathews, Antony Cover-incomparability graphs and chordal graphs. (English) Zbl 1208.05105 Discrete Appl. Math. 158, No. 16, 1752-1759 (2010). MSC: 05C70 PDFBibTeX XMLCite \textit{B. Brešar} et al., Discrete Appl. Math. 158, No. 16, 1752--1759 (2010; Zbl 1208.05105) Full Text: DOI
Adiga, Abhijin; Bhowmick, Diptendu; Chandran, L. Sunil The hardness of approximating the boxicity, cubicity and threshold dimension of a graph. (English) Zbl 1208.05140 Discrete Appl. Math. 158, No. 16, 1719-1726 (2010). MSC: 05C85 PDFBibTeX XMLCite \textit{A. Adiga} et al., Discrete Appl. Math. 158, No. 16, 1719--1726 (2010; Zbl 1208.05140) Full Text: DOI arXiv
Joeris, Benson L.; Lundberg, Scott; McConnell, Ross M. \(O(m\log n)\) split decomposition of strongly-connected graphs. (English) Zbl 1219.05139 Discrete Appl. Math. 158, No. 7, 779-799 (2010). MSC: 05C70 05C85 PDFBibTeX XMLCite \textit{B. L. Joeris} et al., Discrete Appl. Math. 158, No. 7, 779--799 (2010; Zbl 1219.05139) Full Text: DOI
Mancini, Federico Minimum fill-in and treewidth of split \(+ ke\) and split \(+kv\) graphs. (English) Zbl 1216.05159 Discrete Appl. Math. 158, No. 7, 747-754 (2010). MSC: 05C85 PDFBibTeX XMLCite \textit{F. Mancini}, Discrete Appl. Math. 158, No. 7, 747--754 (2010; Zbl 1216.05159) Full Text: DOI
Heggernes, Pinar; Mancini, Federico Minimal split completions. (English) Zbl 1211.05136 Discrete Appl. Math. 157, No. 12, 2659-2669 (2009). MSC: 05C76 05C70 05C69 05C85 PDFBibTeX XMLCite \textit{P. Heggernes} and \textit{F. Mancini}, Discrete Appl. Math. 157, No. 12, 2659--2669 (2009; Zbl 1211.05136) Full Text: DOI
de Werra, D.; Demange, M.; Escoffier, B.; Monnot, J.; Paschos, V. Th. Weighted coloring on planar, bipartite and split graphs: Complexity and approximation. (English) Zbl 1173.05325 Discrete Appl. Math. 157, No. 4, 819-832 (2009). MSC: 05C15 05C85 68R10 68Q25 PDFBibTeX XMLCite \textit{D. de Werra} et al., Discrete Appl. Math. 157, No. 4, 819--832 (2009; Zbl 1173.05325) Full Text: DOI
Dress, Andreas Split decomposition over an Abelian group. II: Group-valued split systems with weakly compatible support. (English) Zbl 1230.05098 Discrete Appl. Math. 157, No. 10, 2349-2360 (2009). MSC: 05C05 05D05 20K99 20N02 92D15 PDFBibTeX XMLCite \textit{A. Dress}, Discrete Appl. Math. 157, No. 10, 2349--2360 (2009; Zbl 1230.05098) Full Text: DOI
Grünewald, S.; Moulton, V.; Spillner, A. Consistency of the QNet algorithm for generating planar split networks from weighted quartets. (English) Zbl 1182.92056 Discrete Appl. Math. 157, No. 10, 2325-2334 (2009). MSC: 92D15 05C90 68W25 05C85 92-08 PDFBibTeX XMLCite \textit{S. Grünewald} et al., Discrete Appl. Math. 157, No. 10, 2325--2334 (2009; Zbl 1182.92056) Full Text: DOI
Ibarra, Louis The clique-separator graph for chordal graphs. (English) Zbl 1173.05036 Discrete Appl. Math. 157, No. 8, 1737-1749 (2009). MSC: 05C69 PDFBibTeX XMLCite \textit{L. Ibarra}, Discrete Appl. Math. 157, No. 8, 1737--1749 (2009; Zbl 1173.05036) Full Text: DOI
Cornelsen, Sabine; di Stefano, Gabriele Treelike comparability graphs. (English) Zbl 1204.05037 Discrete Appl. Math. 157, No. 8, 1711-1722 (2009). MSC: 05C05 05C70 PDFBibTeX XMLCite \textit{S. Cornelsen} and \textit{G. di Stefano}, Discrete Appl. Math. 157, No. 8, 1711--1722 (2009; Zbl 1204.05037) Full Text: DOI
Heggernes, Pinar; Mancini, Federico Dynamically maintaining split graphs. (English) Zbl 1179.05106 Discrete Appl. Math. 157, No. 9, 2057-2069 (2009). MSC: 05C85 05C69 05C76 68R10 PDFBibTeX XMLCite \textit{P. Heggernes} and \textit{F. Mancini}, Discrete Appl. Math. 157, No. 9, 2057--2069 (2009; Zbl 1179.05106) Full Text: DOI
Wang, Fu-Hsing An efficient distributed algorithm for canonical labeling on directed split-stars. (English) Zbl 1180.05115 Discrete Appl. Math. 156, No. 18, 3475-3482 (2008). MSC: 05C85 05C78 05C20 PDFBibTeX XMLCite \textit{F.-H. Wang}, Discrete Appl. Math. 156, No. 18, 3475--3482 (2008; Zbl 1180.05115) Full Text: DOI
Harju, Tero; Li, Chang; Petre, Ion Graph theoretic approach to parallel gene assembly. (English) Zbl 1200.05238 Discrete Appl. Math. 156, No. 18, 3416-3429 (2008). MSC: 05C90 05C22 05C70 92D20 PDFBibTeX XMLCite \textit{T. Harju} et al., Discrete Appl. Math. 156, No. 18, 3416--3429 (2008; Zbl 1200.05238) Full Text: DOI
Rao, Michaël Solving some NP-complete problems using split decomposition. (English) Zbl 1155.05058 Discrete Appl. Math. 156, No. 14, 2768-2780 (2008). MSC: 05C85 05C69 05C70 05C15 68R10 68Q15 PDFBibTeX XMLCite \textit{M. Rao}, Discrete Appl. Math. 156, No. 14, 2768--2780 (2008; Zbl 1155.05058) Full Text: DOI
Ekim, T.; Mahadev, N. V. R.; De Werra, D. Polar cographs. (English) Zbl 1152.05356 Discrete Appl. Math. 156, No. 10, 1652-1660 (2008); corrigendum ibid. 171, 158 (2014). MSC: 05C70 05C85 PDFBibTeX XMLCite \textit{T. Ekim} et al., Discrete Appl. Math. 156, No. 10, 1652--1660 (2008; Zbl 1152.05356) Full Text: DOI
Calamoneri, Tiziana; Petreschi, Rossella \(\lambda\)-coloring matrogenic graphs. (English) Zbl 1107.05087 Discrete Appl. Math. 154, No. 17, 2445-2457 (2006). MSC: 05C90 05C15 68R10 05B35 05C85 94A05 PDFBibTeX XMLCite \textit{T. Calamoneri} and \textit{R. Petreschi}, Discrete Appl. Math. 154, No. 17, 2445--2457 (2006; Zbl 1107.05087) Full Text: DOI
Makino, Kazuhisa; Uno, Yushi; Ibaraki, Toshihide Minimum edge ranking spanning trees of split graphs. (English) Zbl 1142.68054 Discrete Appl. Math. 154, No. 16, 2373-2386 (2006). MSC: 68R10 05C85 PDFBibTeX XMLCite \textit{K. Makino} et al., Discrete Appl. Math. 154, No. 16, 2373--2386 (2006; Zbl 1142.68054) Full Text: DOI
Peng, Sheng-Lung; Chen, Chi-Kang On the interval completion of chordal graphs. (English) Zbl 1159.05049 Discrete Appl. Math. 154, No. 6, 1003-1010 (2006). MSC: 05C85 05C62 PDFBibTeX XMLCite \textit{S.-L. Peng} and \textit{C.-K. Chen}, Discrete Appl. Math. 154, No. 6, 1003--1010 (2006; Zbl 1159.05049) Full Text: DOI
Huber, Katharina T.; Moulton, Vincent; Semple, Charles Replacing cliques by stars in quasi-median graphs. (English) Zbl 1053.05040 Discrete Appl. Math. 143, No. 1-3, 194-203 (2004). MSC: 05C12 05C69 PDFBibTeX XMLCite \textit{K. T. Huber} et al., Discrete Appl. Math. 143, No. 1--3, 194--203 (2004; Zbl 1053.05040) Full Text: DOI
Hell, Pavol; Klein, Sulamita; Nogueira, Loana Tito; Protti, Fábio Partitioning chordal graphs into independent sets and cliques. (English) Zbl 1043.05097 Discrete Appl. Math. 141, No. 1-3, 185-194 (2004). MSC: 05C70 05C69 05C85 PDFBibTeX XMLCite \textit{P. Hell} et al., Discrete Appl. Math. 141, No. 1--3, 185--194 (2004; Zbl 1043.05097) Full Text: DOI
Cai, Leizhen The complexity of the locally connected spanning tree problem. (English) Zbl 1022.05079 Discrete Appl. Math. 131, No. 1, 63-75 (2003). MSC: 05C85 05C05 68R10 PDFBibTeX XMLCite \textit{L. Cai}, Discrete Appl. Math. 131, No. 1, 63--75 (2003; Zbl 1022.05079) Full Text: DOI
Cai, Leizhen Parameterized complexity of vertex colouring. (English) Zbl 1015.05027 Discrete Appl. Math. 127, No. 3, 415-429 (2003). Reviewer: Hans L.Bodlaender (Utrecht) MSC: 05C15 05C85 68Q17 68Q25 68R10 PDFBibTeX XMLCite \textit{L. Cai}, Discrete Appl. Math. 127, No. 3, 415--429 (2003; Zbl 1015.05027) Full Text: DOI
de Figueiredo, Celina M. H.; Klein, Sulamita; Vušković, Kristina The graph sandwich problem for 1-join composition is NP-complete. (English) Zbl 0995.05133 Discrete Appl. Math. 121, No. 1-3, 73-82 (2002). Reviewer: Haiko Müller (Leeds) MSC: 05C85 05C17 68R10 68Q25 PDFBibTeX XMLCite \textit{C. M. H. de Figueiredo} et al., Discrete Appl. Math. 121, No. 1--3, 73--82 (2002; Zbl 0995.05133) Full Text: DOI
Cheng, Eddie; Lipman, Marc J. Vulnerability issues of star graphs, alternating group graphs and split-stars: Strength and toughness. (English) Zbl 0999.05063 Discrete Appl. Math. 118, No. 3, 163-179 (2002). Reviewer: F.Gliviak (Bratislava) MSC: 05C40 PDFBibTeX XMLCite \textit{E. Cheng} and \textit{M. J. Lipman}, Discrete Appl. Math. 118, No. 3, 163--179 (2002; Zbl 0999.05063) Full Text: DOI
Cheston, Grant A.; Hedetniemi, S. T.; Liestman, Arthur L.; Stehman, J. B. The even adjacency split problem for graphs. (English) Zbl 0957.68087 Discrete Appl. Math. 102, No. 3, 175-188 (2000). MSC: 68R10 05C69 PDFBibTeX XMLCite \textit{G. A. Cheston} et al., Discrete Appl. Math. 102, No. 3, 175--188 (2000; Zbl 0957.68087) Full Text: DOI
Cicerone, Serafino; Di Stefano, Gabriele Graph classes between parity and distance-hereditary graphs. (English) Zbl 0933.05144 Discrete Appl. Math. 95, No. 1-3, 197-216 (1999). Reviewer: H.Müller (Jena) MSC: 05C85 05C60 05C75 05C12 PDFBibTeX XMLCite \textit{S. Cicerone} and \textit{G. Di Stefano}, Discrete Appl. Math. 95, No. 1--3, 197--216 (1999; Zbl 0933.05144) Full Text: DOI
Cicerone, Serafino; Di Stefano, Gabriele On the extension of bipartite to parity graphs. (English) Zbl 0933.05132 Discrete Appl. Math. 95, No. 1-3, 181-195 (1999). Reviewer: G.Gutin (Odense) MSC: 05C75 05C69 05C85 PDFBibTeX XMLCite \textit{S. Cicerone} and \textit{G. Di Stefano}, Discrete Appl. Math. 95, No. 1--3, 181--195 (1999; Zbl 0933.05132) Full Text: DOI
Ortiz, Carmen Z.; Maculan, Nelson; Szwarcfiter, Jayme L. Characterizing and edge-colouring split-indifference graphs. (English) Zbl 0901.05043 Discrete Appl. Math. 82, No. 1-3, 209-217 (1998). Reviewer: M.Kubale (Gdańsk) MSC: 05C15 05C75 PDFBibTeX XMLCite \textit{C. Z. Ortiz} et al., Discrete Appl. Math. 82, No. 1--3, 209--217 (1998; Zbl 0901.05043) Full Text: DOI Link
Dress, Andreas; Huson, D.; Moulton, Vincent Analyzing and visualizing sequence and distance data using SPLITSTREE. (English) Zbl 0879.92020 Discrete Appl. Math. 71, No. 1-3, 95-109 (1996). MSC: 92D15 05C90 92D20 PDFBibTeX XMLCite \textit{A. Dress} et al., Discrete Appl. Math. 71, No. 1--3, 95--109 (1996; Zbl 0879.92020) Full Text: DOI Link
Maffray, Frédéric; Preissmann, Myriam Linear recognition of pseudo-split graphs. (English) Zbl 0805.05069 Discrete Appl. Math. 52, No. 3, 307-312 (1994). Reviewer: H.-J.Presia (Ilmenau) MSC: 05C75 05C85 PDFBibTeX XMLCite \textit{F. Maffray} and \textit{M. Preissmann}, Discrete Appl. Math. 52, No. 3, 307--312 (1994; Zbl 0805.05069) Full Text: DOI
Dror, Moshe; Laporte, Gilbert; Trudeau, Pierre Vehicle routing with split deliveries. (English) Zbl 0801.90082 Discrete Appl. Math. 50, No. 3, 239-254 (1994). MSC: 90C10 90B06 90C35 90C60 90C05 PDFBibTeX XMLCite \textit{M. Dror} et al., Discrete Appl. Math. 50, No. 3, 239--254 (1994; Zbl 0801.90082) Full Text: DOI
Brandstädt, Andreas Classes of bipartite graphs related to chordal graphs. (English) Zbl 0763.05052 Discrete Appl. Math. 32, No. 1, 51-60 (1991). MSC: 05C38 05C99 05C75 PDFBibTeX XMLCite \textit{A. Brandstädt}, Discrete Appl. Math. 32, No. 1, 51--60 (1991; Zbl 0763.05052) Full Text: DOI
Corneil, D. G.; Perl, Y. Clustering and domination in perfect graphs. (English) Zbl 0581.05053 Discrete Appl. Math. 9, 27-40 (1984). MSC: 05C99 68R10 PDFBibTeX XMLCite \textit{D. G. Corneil} and \textit{Y. Perl}, Discrete Appl. Math. 9, 27--40 (1984; Zbl 0581.05053) Full Text: DOI