Characterization of classical graph classes by weighted clique graphs
From MaRDI portal
Publication:2448923
DOI10.1016/j.dam.2013.04.013zbMath1288.05120OpenAlexW2085548552MaRDI QIDQ2448923
Jayme Luiz Szwarcfiter, Flavia Bonomo-Braberman
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
Structural characterization of families of graphs (05C75) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69) Signed and weighted graphs (05C22)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Reduced clique graphs of chordal graphs
- Clique graphs of time graphs
- The complexity of clique graph recognition
- A labeling algorithm to recognize a line digraph and output its root graph
- Trivially perfect graphs
- Forbidden induced subgraphs for line graphs
- On clique-complete graphs
- On clique-critical graphs
- A characterisation of rigid circuit graphs
- Restricted circular-arc graphs and clique cycles
- Complexity aspects of the Helly property: graphs and hypergraphs
- Incidence matrices and interval graphs
- A characterization of clique graphs
- The intersection graphs of subtrees in trees are exactly the chordal graphs
- Über iterierte Clique-Graphen
- A Decomposition Theorem for Chordal Graphs and its Applications
- Clique trees of chordal graphs: leafage and 3-asteroidals
- Generating the maximum spanning trees of a weighted graph
- On the tree representation of chordal graphs
- Representations of chordal graphs as subtrees of a tree
- On Graphs Without Multicliqual Edges
- A New Algorithm for Generating All the Maximal Independent Sets
- Dually Chordal Graphs
- The leafage of a chordal graph
- Topics in Intersection Graph Theory
- Clique Graphs of Chordal and Path Graphs
- Line Graphs of Helly Hypergraphs
- The interchange graph of a finite graph
- A partial characterization of clique graphs
- Characterizations of derived graphs
This page was built for publication: Characterization of classical graph classes by weighted clique graphs
