Connector families of graphs

DOI10.1007/S00373-013-1347-3zbMATH Open1306.05124OpenAlexW1981646468MaRDI QIDQ489306FDOQ489306

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

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

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)

Cites Work

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

Cited In (4)

• Triangle-different Hamiltonian paths
• On $k$-Neighbor Separated Permutations
• Structured Codes of Graphs
• Title not available (Why is that?)

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)