On 3-degree 4-chordal graphs

DOI10.1142/S1793830922500537MaRDI QIDQ6174132zbMATH OpenOpenAlexFDO

Authors R. Mahendra Kumar, N. Sadagopan

Publication date 14 July 2023

Published in Discrete Mathematics, Algorithms and Applications (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1142/s1793830922500537

zbMATH Keywords

treewidthSteiner treerainbow coloringHamiltonian cycle (path)3-degree graphs4-chordal graphs

Mathematics Subject Classification ID

Graph algorithms (graph-theoretic aspects) (05C85) Analysis of algorithms and problem complexity (68Q25) Graph theory (including graph drawing) in computer science (68R10) Analysis of algorithms (68W40)

Recommendations

• Cycle transversals in bounded degree graphs
• scientific article; zbMATH DE number 52166
• On the Band-, Tree-, and Clique-Width of Graphs with Bounded Vertex Degree
• Treewidth for graphs with small chordality
• The 3-Colorability Problem on Graphs with Maximum Degree Four

Cites work

• scientific article; zbMATH DE number 3639144 (Why is no real title available?)
• scientific article; zbMATH DE number 1304320 (Why is no real title available?)
• scientific article; zbMATH DE number 824939 (Why is no real title available?)
• scientific article; zbMATH DE number 854567 (Why is no real title available?)
• scientific article; zbMATH DE number 1445284 (Why is no real title available?)
• Complexity of the hamiltonian cycle in regular graph problem
• Computing the Minimum Fill-In is NP-Complete
• Dominating Sets in Chordal Graphs
• Erratum: Optimizing weakly triangulated graphs. [Graphs and Combinatorics 5, 339-349 (1989)]
• Face covers and the genus problem for apex graphs
• HAMILTONian circuits in chordal bipartite graphs
• Hamiltonian circuits determining the order of chromosomes
• Hamiltonian circuits in interval graph generalizations
• Hardness and algorithms for rainbow connection
• Hyperbolicity and chordality of a graph
• Incidence matrices and interval graphs
• On rigid circuit graphs
• On strictly chordality-\(k\) graphs
• Rainbow connection in graphs
• Recognition of Polygon-Circle Graphs and Graphs of Interval Filaments Is NP-Complete
• Satgraphs and independent domination. I
• The Rectilinear Steiner Tree Problem is NP-Complete
• Treewidth of Chordal Bipartite Graphs
• Weakly triangulated graphs

Cited in

(1)

• On 3-regular 4-ordered graphs

This page was built for publication: On 3-degree 4-chordal graphs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6174132)