Strong Chordality of Graphs with Possible Loops

DOI10.1137/20M1316056MaRDI QIDQ5854465zbMATH OpenOpenAlexFDO

Authors César Hernández-Cruz, Jing Huang, Jephian Chin-Hung Lin, Pavol Hell

Publication date 17 March 2021

Published in SIAM Journal on Discrete Mathematics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1137/20m1316056

zbMATH Keywords

dominationtotal dominationstrongly chordal graphtotally balanced matrixforbidden subgraphgamma-free matrix

Mathematics Subject Classification ID

Isomorphism problems in graph theory (reconstruction conjecture, etc.) and homomorphisms (subgraph embedding, etc.) (05C60) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69) Structural characterization of families of graphs (05C75) Perfect graphs (05C17)

Recommendations

• scientific article; zbMATH DE number 4077265
• A characterization of strongly chordal graphs
• A new characterization of strongly chordal graphs
• Dually and strongly chordal graphs
• Planarity of strongly chordal graphs
• Strengthening strongly chordal graphs
• A generalization of chordal graphs
• On the chordality of a graph
• Strong regularity and circulant graphs
• Clique graph characterizations of strongly chordal graphs

Cites work

• scientific article; zbMATH DE number 3859178 (Why is no real title available?)
• scientific article; zbMATH DE number 3685495 (Why is no real title available?)
• Characterizations of strongly chordal graphs
• Characterizations of totally balanced matrices
• Chordal digraphs
• Domination in convex and chordal bipartite graphs
• Domination, independent domination, and duality in strongly chordal graphs
• Doubly Lexical Orderings of Matrices
• Interval bigraphs and circular arc graphs
• Interval graphs, adjusted interval digraphs, and reflexive list homomorphisms
• Min-orderable digraphs
• Perfect Elimination and Chordal Bipartite Graphs
• Permuting matrices to avoid forbidden submatrices
• Representation characterizations of chordal bipartite graphs
• Strongly orderable graphs. A common generalization of strongly chordal and chordal bipartite graphs
• The k-Domination and k-Stability Problems on Sun-Free Chordal Graphs
• Totally-Balanced and Greedy Matrices
• Toward Characterization of Perfect Elimination Digraphs

Cited in

(4)

• Strengthening strongly chordal graphs
• Loop conditions for strongly connected digraphs
• scientific article; zbMATH DE number 4077265 (Why is no real title available?)
• Strong Cocomparability Graphs and Slash-Free Orderings of Matrices

This page was built for publication: Strong Chordality of Graphs with Possible Loops

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