Strongly unichord-free graphs
type: Item
instance of: scholarly article
title: Strongly unichord-free graphs
zbMATH Open document ID: 1404.05097
author: Terry A. McKee
publication date: 2019-02-07T00:00:00Z
Mathematics Subject Classification ID: 05C38
Mathematics Subject Classification ID: 05C40
Mathematics Subject Classification ID: 05C75
zbMATH DE Number: 7014686
zbMATH Keywords: unichord-free graph
zbMATH Keywords: strongly chordal graph
zbMATH Keywords: minimally 2-connected graph
MaRDI profile type: Publication
full work available at URL: dmgt.2080
OpenAlex ID: W2800578951
cites work: Graph Classes: A Survey
cites work: Minimally 2-connected graphs.
cites work: On graphs with no induced subdivision of \(K_4\)
cites work: Total chromatic number of unichord-free graphs
cites work: Edge-colouring and total-colouring chordless graphs
cites work: Complexity of colouring problems restricted to unichord-free and square, unichord-free graphs
cites work: Chromatic index of graphs with no cycle with a unique chord
cites work: Q4878669
cites work: Q5442175
cites work: A new characterization of unichord-free graphs
cites work: Double-crossed chords and distance-hereditary graphs
cites work: Maxclique and unit disk characterizations of strongly chordal graphs
cites work: On Minimal Blocks
cites work: A structure theorem for graphs with no cycle with a unique chord and its consequences
Wikidata QID: Q129912869
DOI: 10.7151/DMGT.2080
published in: Discussiones Mathematicae Graph Theory
description: scientific article; zbMATH DE number 7014686