Some Remarks on the Cycle Plus Triangles Problem

Herbert Fleischner () and Michael Stiebitz ()
Additional contact information
Herbert Fleischner: Technische Universität Wien, Institut für Informationssysteme
Michael Stiebitz: Technische Universität Ilmenau, Institute of Mathematics

A chapter in The Mathematics of Paul Erdős II, 2013, pp 119-125 from Springer

Abstract: Abstract All (undirected) graphs and digraphs considered are assumed to be finite (if not otherwise stated) and loopless. Multiple edges (arcs) are permitted. For a graph G, let V (G), E(G), and χ(G) denote the vertex set, the edge set, and the chromatic number of G, respectively. If X ⊆ V (G) and F ⊆ E(G), then $$G - X - F$$ denotes the subgraph H of G satisfying $$V (H) = V (G) - X$$ and $$E(H) =\{ xy\mid xy \in E(G) - F$$ and $$x,y\not\in X\}$$ .

Keywords: Cycle Asset; Triangle Problem; Loopless; Digraph; Euler Orientation (search for similar items in EconPapers)
Date: 2013
References: Add references at CitEc
Citations:

There are no downloads for this item, see the EconPapers FAQ for hints about obtaining it.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:spr:sprchp:978-1-4614-7254-4_9

Ordering information: This item can be ordered from
http://www.springer.com/9781461472544

DOI: 10.1007/978-1-4614-7254-4_9

Access Statistics for this chapter

More chapters in Springer Books from Springer
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().