A new characterization of unichord-free graphs

DOI10.7151/dmgt.1831zbMath1327.05291OpenAlexW2204761152MaRDI QIDQ891324

Terry A. McKee

Publication date: 17 November 2015

Published in: Discussiones Mathematicae. Graph Theory (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.7151/dmgt.1831

zbMATH Keywords

chordal graphminimal separatorunichord-free graph

Mathematics Subject Classification ID

Structural characterization of families of graphs (05C75) Coloring of graphs and hypergraphs (05C15) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69)

Related Items (5)

Characterizing atoms that result from decomposition by clique separators ⋮ Characterizing k-chordal unichord-free graphs ⋮ New graph classes characterized by weak vertex separators and two-pairs ⋮ Requiring that minimal separators induce complete multipartite subgraphs ⋮ Strongly unichord-free graphs

Cites Work

• Complexity of colouring problems restricted to unichord-free and square, unichord-free graphs
• Total chromatic number of unichord-free graphs
• Decomposition by clique separators
• An algorithm for finding clique cut-sets
• On stable cutsets in graphs
• Chromatic index of graphs with no cycle with a unique chord
• WHEN ALL MINIMAL VERTEX SEPARATORS INDUCE COMPLETE OR EDGELESS SUBGRAPHS
• On the tree representation of chordal graphs
• Topics in Intersection Graph Theory
• Graph Classes: A Survey
• Listing all Minimal Separators of a Graph
• A structure theorem for graphs with no cycle with a unique chord and its consequences
• GENERATING ALL THE MINIMAL SEPARATORS OF A GRAPH
• Unnamed Item
• Unnamed Item

This page was built for publication: A new characterization of unichord-free graphs