Connector families of graphs

DOI10.1007/S00373-013-1347-3MaRDI QIDQ489306zbMATH OpenOpenAlexFDO

Authors Emanuela Fachini, János Körner, Gérard Cohen

Publication date 20 January 2015

Published in Graphs and Combinatorics (Search for Journal in Brave)

Full work available at URL http://jointmathematicsmeetings.org/amsmtgs/2141_abstracts/1086-05-1043.pdf

zbMATH Keywords

connected graphinformation theorygraph capacitypairwise union

Mathematics Subject Classification ID

Isomorphism problems in graph theory (reconstruction conjecture, etc.) and homomorphisms (subgraph embedding, etc.) (05C60) Connectivity (05C40)

Recommendations

• scientific article; zbMATH DE number 759641
• Conditions for families of disjoint \(k\)-connected subgraphs in a graph
• scientific article; zbMATH DE number 2191994
• Publication:4205456
• scientific article; zbMATH DE number 3188526

Cites work

• scientific article; zbMATH DE number 15262 (Why is no real title available?)
• A course in combinatorics.
• Capacities: From information theory to extremal set theory
• Families of graph-different Hamilton paths
• INTERSECTION THEOREMS FOR SYSTEMS OF FINITE SETS
• Information theory. Coding theorems for discrete memoryless systems
• Intersection Theorems on Structures
• On the capacity of Boolean graph formulæ
• Pairwise colliding permutations and the capacity of infinite graphs
• Permutation capacities of families of oriented infinite paths
• Sperner capacities
• Triangle-intersecting families of graphs

Cited in

(4)

• Triangle-different Hamiltonian paths
• Structured Codes of Graphs
• scientific article; zbMATH DE number 759641 (Why is no real title available?)
• On \(k\)-neighbor separated permutations

This page was built for publication: Connector families of graphs

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