A new characterization of unichord-free graphs
From MaRDI portal
Publication:891324
DOI10.7151/DMGT.1831zbMATH Open1327.05291OpenAlexW2204761152MaRDI QIDQ891324FDOQ891324
Authors: 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
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
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)
Cites Work
- Topics in Intersection Graph Theory
- Graph Classes: A Survey
- Decomposition by clique separators
- On the tree representation of chordal graphs
- Total chromatic number of unichord-free graphs
- Listing all Minimal Separators of a Graph
- GENERATING ALL THE MINIMAL SEPARATORS OF A GRAPH
- A structure theorem for graphs with no cycle with a unique chord and its consequences
- On stable cutsets in graphs
- Title not available (Why is that?)
- Chromatic index of graphs with no cycle with a unique chord
- Complexity of colouring problems restricted to unichord-free and square, unichord-free graphs
- An algorithm for finding clique cut-sets
- When all minimal vertex separators induce complete or edgeless subgraphs
- Independent separator graphs
Cited In (9)
- Characterizing k-chordal unichord-free graphs
- Title not available (Why is that?)
- Title not available (Why is that?)
- 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)
