Forbidden pairs with a common graph generating almost the same sets

MaRDI QIDQ528989zbMATH OpenFDO

Authors Shuya Chiba, Jun Fujisawa, Michitaka Furuya, 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

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

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)

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

Cites work

• scientific article; zbMATH DE number 3730183 (Why is no real title available?)
• A pair of forbidden subgraphs and perfect matchings in graphs of high connectivity
• Characterizing forbidden pairs for hamiltonian properties
• Claw-free graphs---a survey
• Forbidden subgraphs generating almost the same sets
• Graph theory

Cited in

(4)

• Families of pairs of graphs with a large number of common cards
• Forbidden subgraphs generating almost the same sets
• A pair of forbidden subgraphs and perfect matchings.
• scientific article; zbMATH DE number 1556738 (Why is no real title available?)

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)