Forbidden pairs with a common graph generating almost the same sets

zbMath1361.05084MaRDI QIDQ528989

Michitaka Furuya, Jun Fujisawa, Shuya Chiba, Hironobu Ikarashi

Publication date: 18 May 2017

Published in: The Electronic Journal of Combinatorics (Search for Journal in Brave)

Full work available at URL: http://www.combinatorics.org/ojs/index.php/eljc/article/view/v24i2p13

zbMATH Keywords

vertex-transitive graphstar-free graphforbidden subgraph

Mathematics Subject Classification ID

Graphs and abstract algebra (groups, rings, fields, etc.) (05C25) Connectivity (05C40) Isomorphism problems in graph theory (reconstruction conjecture, etc.) and homomorphisms (subgraph embedding, etc.) (05C60)

Cites Work

• Unnamed Item
• Unnamed Item
• Claw-free graphs---a survey
• Characterizing forbidden pairs for hamiltonian properties
• A pair of forbidden subgraphs and perfect matchings in graphs of high connectivity
• Forbidden Subgraphs Generating Almost the Same Sets

This page was built for publication: Forbidden pairs with a common graph generating almost the same sets