Graph theory nomenclature

From: Jón Fairbairn (jon.fairbairn_at_cl.cam.ac.uk)
Date: 10/15/04 

Date: 15 Oct 2004 10:25:37 +0100

I have the vague idea that I ought to know the answer to
this, but: What's the name for a subgraph of a directed
graph where all the edges crossing its boundary are directed
outwards (or all inwards)? 

-- 
Jón Fairbairn                                 Jon.Fairbairn@cl.cam.ac.uk

Relevant Pages

  • Re: Saunders MacLane
    ... _fixed_ graph H, whether a graph G contains a subgraph ... homeomorphism of H and a subgraph of G is in P. ...
    (sci.math)
  • Re: Time complexity of couting the number of cliques on k nodes
    ... of vertices of the host graph is part of the input. ... especially as the clique size k gets ... Remove all vertices of degree less than k-1 and their neighboring ... take the resulting subgraph and go to step ...
    (sci.math)
  • Re: OT: is the AGW bubble about to burst?
    ... admitted that I think Mann screwed up, if only by producing a graph ... that was prettier than it ought to have been. ...
    (sci.electronics.design)
  • Re: I have a paper on graph coloring
    ... Such a graph can be used in the place of ... you should get a coloring that contradicts Concept 2. ... To tie this in to the definition of a "basic graph" I gave further ... points, but not necessarily the other way around, because the subgraph ...
    (sci.math)
  • Re: Proof of the Four Color Theorem by Contradiction
    ... one of those configurations can be an MCE. ... You show that every plane graph contains at least one ... existence of such a kind of subgraph in any plane graph is ...
    (sci.math)