Perfect k‐line graphs and k‐total graphs
From MaRDI portal
Publication:4693345
DOI10.1002/jgt.3190170108zbMath0778.05073OpenAlexW1597877241MaRDI QIDQ4693345
Publication date: 13 December 1993
Published in: Journal of Graph Theory (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1002/jgt.3190170108
Structural characterization of families of graphs (05C75) Coloring of graphs and hypergraphs (05C15) Isomorphism problems in graph theory (reconstruction conjecture, etc.) and homomorphisms (subgraph embedding, etc.) (05C60)
Related Items (7)
Induced cycles in triangle graphs ⋮ Gallai graphs and anti-Gallai graphs ⋮ Generalized line graphs: Cartesian products and complexity of recognition ⋮ Unnamed Item ⋮ A simple linear time algorithm for the locally connected spanning tree problem on maximal planar chordal graphs ⋮ On \((k+1)\)-line graphs of \(k\)-trees and their nullities ⋮ Subclasses of \(k\)-trees: characterization and recognition
Cites Work
This page was built for publication: Perfect k‐line graphs and k‐total graphs