Strong Chordality of Graphs with Possible Loops

DOI10.1137/20M1316056zbMath1459.05238OpenAlexW3134112375MaRDI QIDQ5854465

Jephian C.-H. Lin, Jing Huang, César Hernández-Cruz, 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

dominationtotally balanced matrixtotal dominationstrongly chordal graphforbidden subgraphgamma-free matrix

Mathematics Subject Classification ID

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

Related Items (1)

Strong Cocomparability Graphs and Slash-Free Orderings of Matrices

Cites Work

• Unnamed Item
• Unnamed Item
• Interval graphs, adjusted interval digraphs, and reflexive list homomorphisms
• Domination, independent domination, and duality in strongly chordal graphs
• Domination in convex and chordal bipartite graphs
• Characterizations of strongly chordal graphs
• Permuting matrices to avoid forbidden submatrices
• Chordal digraphs
• Strongly orderable graphs. A common generalization of strongly chordal and chordal bipartite graphs
• Representation characterizations of chordal bipartite graphs
• Characterizations of totally balanced matrices
• Totally-Balanced and Greedy Matrices
• The k-Domination and k-Stability Problems on Sun-Free Chordal Graphs
• Doubly Lexical Orderings of Matrices
• Perfect Elimination and Chordal Bipartite Graphs
• Toward Characterization of Perfect Elimination Digraphs
• Interval bigraphs and circular arc graphs
• Min-Orderable Digraphs

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