The square of a chordal graph

DOI10.1016/0012-365X(94)90110-4zbMath0795.05118OpenAlexW2018266027WikidataQ127098473 ScholiaQ127098473MaRDI QIDQ1322181

Terry A. McKee, Frank Harary

Publication date: 5 May 1994

Published in: Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0012-365x(94)90110-4

zbMATH Keywords

algorithmmultigraphschordal graphs\(k\)-trees

Mathematics Subject Classification ID

Trees (05C05) Structural characterization of families of graphs (05C75) Graph algorithms (graph-theoretic aspects) (05C85)

Related Items (9)

Distributed scheduling for disconnected cooperation ⋮ Powers of distance-hereditary graphs ⋮ Political districting: from classical models to recent approaches ⋮ Domination in digraphs and their direct and Cartesian products ⋮ Tutte and Jones polynomials of links, polyominoes and graphical recombination patterns ⋮ Political districting: From classical models to recent approaches ⋮ On the page number of RNA secondary structures with pseudoknots ⋮ On the structure of a Morse form foliation ⋮ A characterization of graphs with interval two-step graphs

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Parallel concepts in graph theory
• On simple characterizations of k-trees
• Incidence matrices and interval graphs
• A Graph Theoretic Method for the Complete Reduction of a Matrix with a View Toward Finding its Eigenvalues
• The square root of a graph
• On acyclic simplicial complexes
• Properties and characterizations of k ‐trees

This page was built for publication: The square of a chordal graph