Mock threshold graphs

DOI10.1016/j.disc.2018.04.023zbMath1388.05073arXiv1602.06622OpenAlexW2963061996MaRDI QIDQ1637131

Richard Behr, Thomas Zaslavsky, Vaidy Sivaraman

Publication date: 7 June 2018

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

Full work available at URL: https://arxiv.org/abs/1602.06622

zbMATH Keywords

claw-free graphline graphperfect graphchordal graphforbidden induced subgraphmock threshold graph

Mathematics Subject Classification ID

Perfect graphs (05C17) Isomorphism problems in graph theory (reconstruction conjecture, etc.) and homomorphisms (subgraph embedding, etc.) (05C60) Graph operations (line graphs, products, etc.) (05C76)

Related Items

On total coloring of some classes of regular graphs ⋮ Forbidden induced subgraphs ⋮ Linear-time recognition of double-threshold graphs

Cites Work

• Unnamed Item
• On rigid circuit graphs
• Weakly triangulated graphs
• The strong perfect graph theorem
• Hamiltonian threshold graphs
• Claw-free graphs---a survey
• Threshold graphs and related topics
• Quasi-threshold graphs
• Upper bounds to the clique width of graphs
• A characterization of perfect graphs
• Improved algorithms for weakly chordal graphs
• Complexity Results for Bandwidth Minimization
• Characterizations of derived graphs