Line perfect graphs

  title={Line perfect graphs},
  author={L. Trotter},
  journal={Mathematical Programming},
  • L. Trotter
  • Published 1977
  • Mathematics, Computer Science
  • Mathematical Programming
The concept of line perfection of a graph is defined so that a simple graph is line perfect if and only if its line graph is perfect in the usual sense. Line perfect graphs are characterized as those which contain no odd cycles of size larger than 3. Two well-know theorems of König for bipartite graphs are shown to hold also for line perfect graphs; this extension provides a reinterpretation of the content of these theorems. 
Neighbourhood-Perfect Line Graphs
  • J. Lehel
  • Mathematics, Computer Science
  • Graphs Comb.
  • 1994
It is shown that the line graph of any balanced hypergraph is neighbourhood-perfect, and the note contains also a graphical extension of the same theorem: the characterization of all graphs with neighbourhood- Perfect line graph. Expand
On line perfect graphs
  • D. Werra
  • Mathematics, Computer Science
  • Math. Program.
  • 1978
The purpose of this note is to give an algorithmic proof that the chromatic index of these graphs is equal to the maximum cardinality of a set of mutually adjacent edges. Expand
The Strong Perfect Graph Theorem for a Class of Partitionable Graphs
A simple adjacency criterion is presented which, when satisfied, implies that a minimal imperfect graph is an odd hole or an odd antihole. For certain classes of graphs, including K 1,3 -free graphs,Expand
Perfect k-line graphs and k-total graphs
  • V. B. Le
  • Mathematics, Computer Science
  • J. Graph Theory
  • 1993
The Perfect Graph Conjecture will be proved for 3-line graphs and 3-total graphs and perfect 3- line graphs are not contained in any of the known classes of perfect graphs. Expand
Kernels in perfect line-graphs
It is proved that the conjecture that an undirected graph G is perfect if and only if the following condition is satisfied holds when G is the line-graph of another graph H, i.e., G represents the incidence between the edges of H. Expand
Classes of perfect graphs
  • S. Hougardy
  • Computer Science, Mathematics
  • Discret. Math.
  • 2006
This paper surveys 120 new classes of graphs, survey 120 of these classes, list their fundamental algorithmic properties and present all known relations between them. Expand
Polyhedral Characterizations, Perfection of Line Graphs
A polyhedral characterization of line graphs is given that, in some sense, gives a converse to Edmonds' matching theorem and a class ofh-perfect graphs that are neither perfect nort-perfect. Expand
The edge intersection graphs of paths in a tree
It is demonstrated that the problem of finding a maximum clique of an EPT graph can be solved in polynomial time, and it is shown that the strong perfect graph conjecture holds for EPT graphs. Expand
On edge perfectness and classes of bipartite graphs
A notion of dependence for the edges of a graph is defined and a concept of edge perfectness is derived and the complexity of the corresponding algorithms is investigated. Expand
A list analog of Vizing's Theorem for simple graphs with triangles but no other odd cycles
This paper has been withdrawn by the author. Peterson and Woodall previously proved that the list-edge-colouring conjecture holds for graphs without odd cycles of length 5 or longer. D. Peterson andExpand


The strong perfect-graph conjecture is true for K1, 3-free graphs
Berge's strong perfect-graph conjecture is shown to be true for graphs which do not have K1, 3 as an induced subgraph and the line graphs thus belong to the class of graphs for which the conjecture is true. Expand
Normal hypergraphs and the perfect graph conjecture
A hypergraph is called normal if the chromatic index of any partial hypergraph H' of it coincides with the maximum valency in H'. It is proved that a hypergraph is normal iff the maximum number ofExpand
On the Perfect Graph Theorem
Publisher Summary This chapter provides an overview of perfect graph theorem. A version of the perfect graph theorem says, “Let A be a (0, l)-matrix such that the linear program yA w, y 0, min 1. yExpand
Paths, Trees, and Flowers
A graph G for purposes here is a finite set of elements called vertices and a finite set of elements called edges such that each edge meets exactly two vertices, called the end-points of the edge. AnExpand
Simple Constructions for Balanced Incomplete Block Designs with Block Size Three
This paper provides a simpler proof for this case of a sequence of three-element subsets of S such that each two-element subset of S is contained in exactly λ terms of the sequence if and only if λ(v − 1) 2 and λv(v + 1) 6 are integers. Expand
A Characterization of Perfect Graphs
Throughout this note, graph means finite, undirected graph without loops and multiple edges.
Maximum matching and a polyhedron with 0,1-vertices
The emphasis in this paper is on relating the matching problem to the theory of continuous linear programming, and the algorithm described does not involve any "blind-alley programming" -which, essentially, amounts to testing a great many combinations. Expand
Establishing the matching polytope
Abstract This paper gives an elementary, inductive proof-“graphical” in spirit-of a theorem of Edmonds' which specifies the convex hull of the matchings of an arbitrary, finite, undirected graph inExpand
Blocking and anti-blocking pairs of polyhedra
Some of the main notions and theorems about blocking pairs of polyhedra and antiblocking pairs of polyhedra are described. The two geometric duality theories conform in many respects, but there areExpand
Anti-blocking polyhedra
A theory parallel to that for blocking pairs of polyhedra is developed for anti-blocking pairs of polyhedra, and certain combinatorial results and problems are discussed in this framework. Expand