Academic literature on the topic 'K-chordal Graphs'
Create a spot-on reference in APA, MLA, Chicago, Harvard, and other styles
Consult the lists of relevant articles, books, theses, conference reports, and other scholarly sources on the topic 'K-chordal Graphs.'
Next to every source in the list of references, there is an 'Add to bibliography' button. Press on it, and we will generate automatically the bibliographic reference to the chosen work in the citation style you need: APA, MLA, Harvard, Chicago, Vancouver, etc.
You can also download the full text of the academic publication as pdf and read online its abstract whenever available in the metadata.
Journal articles on the topic "K-chordal Graphs"
Fomin, Fedor V., and Petr A. Golovach. "Subexponential Parameterized Algorithms and Kernelization on Almost Chordal Graphs." Algorithmica 83, no. 7 (2021): 2170–214. http://dx.doi.org/10.1007/s00453-021-00822-x.
Full textLee, Chuan-Min. "Algorithmic Aspects of Some Variations of Clique Transversal and Clique Independent Sets on Graphs." Algorithms 14, no. 1 (2021): 22. http://dx.doi.org/10.3390/a14010022.
Full textPRADHAN, D. "COMPLEXITY OF CERTAIN FUNCTIONAL VARIANTS OF TOTAL DOMINATION IN CHORDAL BIPARTITE GRAPHS." Discrete Mathematics, Algorithms and Applications 04, no. 03 (2012): 1250045. http://dx.doi.org/10.1142/s1793830912500450.
Full textPanda, B. S., and D. Pradhan. "A linear time algorithm to compute a minimum restrained dominating set in proper interval graphs." Discrete Mathematics, Algorithms and Applications 07, no. 02 (2015): 1550020. http://dx.doi.org/10.1142/s1793830915500202.
Full textNagarathinam, R., N. Parvathi, and . "Grundy Number of Some Chordal Graphs." International Journal of Engineering & Technology 7, no. 4.10 (2018): 64. http://dx.doi.org/10.14419/ijet.v7i4.10.20708.
Full textMcKee, Terry A. "Characterizing k-chordal unichord-free graphs." Discrete Mathematics, Algorithms and Applications 10, no. 04 (2018): 1850043. http://dx.doi.org/10.1142/s179383091850043x.
Full textGunda, Spoorthy, Pallavi Jain, Daniel Lokshtanov, Saket Saurabh, and Prafullkumar Tale. "On the Parameterized Approximability of Contraction to Classes of Chordal Graphs." ACM Transactions on Computation Theory 13, no. 4 (2021): 1–40. http://dx.doi.org/10.1145/3470869.
Full textSHERMAN, DAVID, MING TSAI, CHENG-KUAN LIN, et al. "4-ORDERED HAMILTONICITY FOR SOME CHORDAL RING GRAPHS." Journal of Interconnection Networks 11, no. 03n04 (2010): 157–74. http://dx.doi.org/10.1142/s0219265910002787.
Full textMarkenzon, Lilian, Paulo Renato da Costa Pereira, and Christina F. E. M. Waga. "k-separator chordal graphs: leafage and subfamilies." International Transactions in Operational Research 20, no. 5 (2012): 681–88. http://dx.doi.org/10.1111/j.1475-3995.2012.00875.x.
Full textGoodarzi, Afshin. "Clique vectors of k-connected chordal graphs." Journal of Combinatorial Theory, Series A 132 (May 2015): 188–93. http://dx.doi.org/10.1016/j.jcta.2015.01.001.
Full textDissertations / Theses on the topic "K-chordal Graphs"
Mathew, Rogers. "Boxicity And Cubicity : A Study On Special Classes Of Graphs." Thesis, 2012. https://etd.iisc.ac.in/handle/2005/2320.
Full textMathew, Rogers. "Boxicity And Cubicity : A Study On Special Classes Of Graphs." Thesis, 2012. http://etd.iisc.ernet.in/handle/2005/2320.
Full textBook chapters on the topic "K-chordal Graphs"
Chepoi, Victor D., Feodor F. Dragan, and Chenyu Yan. "Additive Spanners for k-Chordal Graphs." In Lecture Notes in Computer Science. Springer Berlin Heidelberg, 2003. http://dx.doi.org/10.1007/3-540-44849-7_16.
Full textWatrigant, Rémi, Marin Bougeret, and Rodolphe Giroudeau. "Approximating the Sparsest k-Subgraph in Chordal Graphs." In Approximation and Online Algorithms. Springer International Publishing, 2014. http://dx.doi.org/10.1007/978-3-319-08001-7_7.
Full textKammer, Frank, and Torsten Tholey. "The k-Disjoint Paths Problem on Chordal Graphs." In Graph-Theoretic Concepts in Computer Science. Springer Berlin Heidelberg, 2010. http://dx.doi.org/10.1007/978-3-642-11409-0_17.
Full textDourisboure, Yon. "Compact Routing Schemes for Bounded Tree-Length Graphs and for k-Chordal Graphs." In Lecture Notes in Computer Science. Springer Berlin Heidelberg, 2004. http://dx.doi.org/10.1007/978-3-540-30186-8_26.
Full textBougeret, Marin, Nicolas Bousquet, Rodolphe Giroudeau, and Rémi Watrigant. "Parameterized Complexity of the Sparsest k-Subgraph Problem in Chordal Graphs." In SOFSEM 2014: Theory and Practice of Computer Science. Springer International Publishing, 2014. http://dx.doi.org/10.1007/978-3-319-04298-5_14.
Full textKosowski, Adrian, Bi Li, Nicolas Nisse, and Karol Suchan. "k-Chordal Graphs: From Cops and Robber to Compact Routing via Treewidth." In Automata, Languages, and Programming. Springer Berlin Heidelberg, 2012. http://dx.doi.org/10.1007/978-3-642-31585-5_54.
Full textDeHaan, Ian, and Zachary Friggstad. "Approximate Minimum Sum Colorings and Maximum k-Colorable Subgraphs of Chordal Graphs." In Lecture Notes in Computer Science. Springer Nature Switzerland, 2023. http://dx.doi.org/10.1007/978-3-031-38906-1_22.
Full textConte, Alessio, Mamadou Moustapha Kanté, Yota Otachi, Takeaki Uno, and Kunihiro Wasa. "Efficient Enumeration of Maximal k-Degenerate Subgraphs in a Chordal Graph." In Lecture Notes in Computer Science. Springer International Publishing, 2017. http://dx.doi.org/10.1007/978-3-319-62389-4_13.
Full textAmanathulla, Sk, and Madhumangal Pal. "L(h,k)-Labeling of Intersection Graphs." In Handbook of Research on Advanced Applications of Graph Theory in Modern Society. IGI Global, 2020. http://dx.doi.org/10.4018/978-1-5225-9380-5.ch007.
Full textConference papers on the topic "K-chordal Graphs"
Araujo, Julio, Alexandre Cezar, Carlos Vinícius Gomes Costa Lima, Vinicius Fernandes Dos Santos, and Ana Shirley Ferreira Silva. "Proper Orientations of Chordal Graphs." In Encontro de Teoria da Computação. Sociedade Brasileira de Computação - SBC, 2020. http://dx.doi.org/10.5753/etc.2020.11080.
Full textSobral, Gabriel A. G., Marina Groshaus, and André L. P. Guedes. "Biclique edge-choosability in some classes of graphs∗." In II Encontro de Teoria da Computação. Sociedade Brasileira de Computação - SBC, 2017. http://dx.doi.org/10.5753/etc.2017.3203.
Full textSantos, Tanilson D., Jayme Szwarcfiter, Uéverton S. Souza, and Claudson F. Bornstein. "On the Helly Property of Some Intersection Graphs." In Concurso de Teses e Dissertações da SBC. Sociedade Brasileira de Computação, 2021. http://dx.doi.org/10.5753/ctd.2021.15752.
Full textAndrade, Davi de, and Ana Silva. "On the Complexity of Subfall Coloring of Graphs." In Encontro de Teoria da Computação. Sociedade Brasileira de Computação - SBC, 2021. http://dx.doi.org/10.5753/etc.2021.16383.
Full text