scientific article; zbMATH DE number 3914360

MaRDI QIDQ3691771zbMATH OpenFDO

Authors V. I. Voloshin

Publication date 1982

zbMATH Keywords

chromatic polynomialsdiametral chaindistance matrixtriangulated graph

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15) Paths and cycles (05C38) Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50)

Recommendations

• scientific article; zbMATH DE number 4114700
• Chromaticity of triangulated graphs
• On the Interval Number of a Triangulated Graph
• Weakly triangulated graphs
• More characterizations of triangulated graphs

Cited in

(10)

• \(r\)-dominating cliques in graphs with hypertree structure
• On the contour of bipartite graphs
• Tree spanners on chordal graphs: complexity and algorithms
• Avoidable vertices and edges in graphs: existence, characterization, and applications
• The vertex Euclidean properties of graphs
• scientific article; zbMATH DE number 4132197 (Why is no real title available?)
• scientific article; zbMATH DE number 4085714 (Why is no real title available?)
• More characterizations of triangulated graphs
• Dually chordal graphs
• Graph properties of graph associahedra

This page was built for publication:

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