Forbidden pairs with a common graph generating almost the same sets

zbMATH Open1361.05084MaRDI QIDQ528989FDOQ528989

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

File on IPFS (Hint: this is only the Hash - if you get a timeout, this file is not available on our server.)

Recommendations

• Forbidden subgraphs generating almost the same sets
• Forbidden quadruplets generating a finite set of 2-connected graphs
• Forbidden pairs for equality of connectivity and edge-connectivity of graphs
• Forbidden subgraphs generating a finite set
• Forbidden induced subgraphs for star-free graphs

zbMATH Keywords

star-free graphvertex-transitive graphforbidden subgraph

Mathematics Subject Classification ID

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

Cites Work

• Title not available (Why is that?)
• Claw-free graphs---a survey
• Characterizing forbidden pairs for hamiltonian properties
• Title not available (Why is that?)
• A pair of forbidden subgraphs and perfect matchings in graphs of high connectivity
• Forbidden Subgraphs Generating Almost the Same Sets

Cited In (3)

• A pair of forbidden subgraphs and perfect matchings.
• Title not available (Why is that?)
• Families of pairs of graphs with a large number of common cards

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

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