Library

X
feed icon rss

Your email was sent successfully. Check your inbox.

An error occurred while sending the email. Please try again.

Proceed reservation?

Export
  • 1
    Electronic Resource
    Electronic Resource
    AMALGAMATION OF GRAPHS AND ITS APPLICATIONS (1979)
    Oxford, UK : Blackwell Publishing Ltd
    Annals of the New York Academy of Sciences 319 (1979), S. 0 
    Details
    ISSN: 1749-6632
    Source: Blackwell Publishing Journal Backfiles 1879-2005
    Topics: Natural Sciences in General
    Type of Medium: Electronic Resource
    URL: http://dx.doi.org/10.1111/j.1749-6632.1979.tb32819.x
    Library Location Call Number Volume/Issue/Year Availability
    BibTip Others were also interested in ...
    Paper (German National Licenses)
    Fulltext
  • 2
    Electronic Resource
    Electronic Resource
    The chromatic connectivity of graphs (1988)
    Springer
    Graphs and combinatorics 4 (1988), S. 229-233 
    Details
    ISSN: 1435-5914
    Source: Springer Online Journal Archives 1860-2000
    Topics: Computer Science , Mathematics
    Notes: Abstract A graphG ischromatically k-connected if every vertex cutset induces a subgraph with chromatic number at leastk. This concept arose in some work, involving the third author, on Ramsey Theory. (For the reference, see the text.) Here we begin the study of chromatic connectivity for its own sake. We show thatG is chromaticallyk-connected iff every homomorphic image of it isk-connected. IfG has no triangles then it is at most chromatically 1-connected, but we prove that the Kneser graphs provide examples ofK 4-free graphs with arbitrarily large chromatic connectivity. We also verify thatK 4-free planar graphs are at most chromatically 2-connected.
    Type of Medium: Electronic Resource
    URL: http://dx.doi.org/10.1007/BF01864163
    Library Location Call Number Volume/Issue/Year Availability
    BibTip Others were also interested in ...
    Paper (German National Licenses)
    Fulltext
  • 3
    Electronic Resource
    Electronic Resource
    Homomorphisms of graphs and of their orientations (1978)
    Springer
    Monatshefte für Mathematik 85 (1978), S. 39-48 
    Details
    ISSN: 1436-5081
    Source: Springer Online Journal Archives 1860-2000
    Topics: Mathematics
    Notes: Abstract Consider a set of graphs and all the homomorphisms among them. Change each graph into a digraph by assigning directions to its edges. Some of the homomorphisms preserve the directions and so remain as homomorphisms of the set of digraphs; others do not. We study the relationship between the original set of graph-homomorphisms and the resulting set of digraph-homomorphisms and prove that they are in a certain sense independent. This independence result no longer holds if we start with a proper class of graphs, or if we require that only one direction be given to each edge (unless each homomorphism is invertible, in which case we again prove independence). We also specialize the results to the set consisting of one graph and prove the independence of monoids (groups) of a graph and the corresponding digraph.
    Type of Medium: Electronic Resource
    URL: http://dx.doi.org/10.1007/BF01300959
    Library Location Call Number Volume/Issue/Year Availability
    BibTip Others were also interested in ...
    Paper (German National Licenses)
    Fulltext
  • 4
    Electronic Resource
    Electronic Resource
    The structure of critical Ramsey graphs (1978)
    Springer
    Acta mathematica hungarica 32 (1978), S. 295-300 
    Details
    ISSN: 1588-2632
    Source: Springer Online Journal Archives 1860-2000
    Topics: Mathematics
    Type of Medium: Electronic Resource
    URL: http://dx.doi.org/10.1007/BF01902367
    Library Location Call Number Volume/Issue/Year Availability
    BibTip Others were also interested in ...
    Paper (German National Licenses)
    Fulltext
Close ⊗
This website uses cookies and the analysis tool Matomo. More information can be found here...