On a class of square-free graphs

DOI10.1016/0020-0190(95)00175-1MaRDI QIDQ1350762zbMATH OpenOpenAlexFDO

Authors Qingbo Xue

Publication date 27 February 1997

Published in Information Processing Letters (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/0020-0190(95)00175-1

zbMATH Keywords

combinatorial problemsperfectholeF-free

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10)

Recommendations

• On square-free vertex colorings of graphs
• On square-free edge colorings of graphs
• On square-Hamiltonian graphs
• On edge-transitive graphs of square-free order
• Square-free graphs with no induced fork
• On square sum graphs
• On square sum graphs
• On the structure of clique-free graphs
• scientific article; zbMATH DE number 7597458
• Square-free graphs are multiplicative

Cites work

• scientific article; zbMATH DE number 3902681 (Why is no real title available?)
• Normal hypergraphs and the perfect graph conjecture
• Star-cutsets and perfect graphs

Cited in

(6)

• scientific article; zbMATH DE number 915922 (Why is no real title available?)
• On edge-transitive graphs of square-free order
• The square of a connected S(K1,3)-free graph is vertex pancyclic
• On the closure of graphs under substitution
• Square-free perfect graphs.
• Square-Free Graphs with No Six-Vertex Induced Path

This page was built for publication: On a class of square-free graphs

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