A new characterization of unichord-free graphs

DOI10.7151/DMGT.1831MaRDI QIDQ891324zbMATH OpenOpenAlexFDO

Authors Terry A. McKee

Publication date 17 November 2015

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

Copyright license Creative Commons Attribution-NonCommercial-NoDerivatives 4.0 International

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

zbMATH Keywords

chordal graphminimal separatorunichord-free graph

Mathematics Subject Classification ID

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

Recommendations

• Characterizing k-chordal unichord-free graphs
• Strongly unichord-free graphs
• A NEW CHARACTERIZATION OF UNBREAKABLE GRAPHS
• A new characterization of P_k-free graphs
• A New Characterization of P_k-free Graphs
• scientific article; zbMATH DE number 60247
• Total chromatic number of unichord-free graphs
• A note on the nullity of unicyclic graphs
• A characterization of unimodular orientations of simple graphs
• On the spectral characterization of some unicyclic graphs

Cites work

• scientific article; zbMATH DE number 1161313 (Why is no real title available?)
• A structure theorem for graphs with no cycle with a unique chord and its consequences
• An algorithm for finding clique cut-sets
• Chromatic index of graphs with no cycle with a unique chord
• Complexity of colouring problems restricted to unichord-free and square, unichord-free graphs
• Decomposition by clique separators
• GENERATING ALL THE MINIMAL SEPARATORS OF A GRAPH
• Graph Classes: A Survey
• Independent separator graphs
• Listing all Minimal Separators of a Graph
• On stable cutsets in graphs
• On the tree representation of chordal graphs
• Topics in Intersection Graph Theory
• Total chromatic number of unichord-free graphs
• When all minimal vertex separators induce complete or edgeless subgraphs

Cited in

(9)

• Characterizing k-chordal unichord-free graphs
• scientific article; zbMATH DE number 2104096 (Why is no real title available?)
• scientific article; zbMATH DE number 165562 (Why is no real title available?)
• Characterizing atoms that result from decomposition by clique separators
• UNKNOTTING SINGULAR CHARTS WITH NO BLACK VERTICES BY REDUCING NODE-PAIRS
• Strongly unichord-free graphs
• Requiring that minimal separators induce complete multipartite subgraphs
• New graph classes characterized by weak vertex separators and two-pairs
• A New Characterization of P_k-free Graphs

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

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