Characterization of classical graph classes by weighted clique graphs

DOI10.1016/J.DAM.2013.04.013MaRDI QIDQ2448923zbMATH OpenOpenAlexFDO

Authors Flavia Bonomo, Jayme L. Szwarcfiter

Publication date 5 May 2014

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

Full work available at URL https://doi.org/10.1016/j.dam.2013.04.013

zbMATH Keywords

graph classes structural characterizationweighted clique graphs

Mathematics Subject Classification ID

Signed and weighted graphs (05C22) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69) Structural characterization of families of graphs (05C75)

Recommendations

• On weighted clique graphs
• A class of clique-closed graphs
• scientific article; zbMATH DE number 2096431
• Graph classes with and without powers of bounded clique-width
• Spectral characterization of some weighted rooted graphs with cliques
• Clique-width for graph classes closed under complementation
• scientific article; zbMATH DE number 7204407
• Clique-perfectness and balancedness of some graph classes
• On the clique-width of some perfect graph classes
• Edge elimination and weighted graph classes

Cites work

• A characterisation of rigid circuit graphs
• A characterization of clique graphs
• A decomposition theorem for chordal graphs and its applications
• A labeling algorithm to recognize a line digraph and output its root graph
• A New Algorithm for Generating All the Maximal Independent Sets
• A partial characterization of clique graphs
• Characterizations of derived graphs
• Clique graph characterizations of strongly chordal graphs
• Clique Graphs of Chordal and Path Graphs
• Clique graphs of time graphs
• Clique trees of chordal graphs: leafage and 3-asteroidals
• Complexity aspects of the Helly property: graphs and hypergraphs
• Dually Chordal Graphs
• Forbidden induced subgraphs for line graphs
• Generating the maximum spanning trees of a weighted graph
• scientific article; zbMATH DE number 3758364 (Why is no real title available?)
• scientific article; zbMATH DE number 19202 (Why is no real title available?)
• scientific article; zbMATH DE number 22656 (Why is no real title available?)
• scientific article; zbMATH DE number 553916 (Why is no real title available?)
• scientific article; zbMATH DE number 734470 (Why is no real title available?)
• scientific article; zbMATH DE number 3286813 (Why is no real title available?)
• scientific article; zbMATH DE number 3307330 (Why is no real title available?)
• scientific article; zbMATH DE number 3402664 (Why is no real title available?)
• scientific article; zbMATH DE number 3102314 (Why is no real title available?)
• Incidence matrices and interval graphs
• Line Graphs of Helly Hypergraphs
• On clique-complete graphs
• On clique-critical graphs
• On Graphs Without Multicliqual Edges
• On the tree representation of chordal graphs
• On weighted clique graphs
• Reduced clique graphs of chordal graphs
• Representations of chordal graphs as subtrees of a tree
• Restricted circular-arc graphs and clique cycles
• The complexity of clique graph recognition
• The interchange graph of a finite graph
• The intersection graphs of subtrees in trees are exactly the chordal graphs
• The leafage of a chordal graph
• Topics in Intersection Graph Theory
• Trivially perfect graphs
• Über iterierte Clique-Graphen

Cited in

(1)

• On weighted clique graphs

This page was built for publication: Characterization of classical graph classes by weighted clique graphs

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