Partial Characterizations of 1‐Perfectly Orientable Graphs
From MaRDI portal
Publication:5272923
DOI10.1002/jgt.22067zbMath1365.05109arXiv1411.6663OpenAlexW2962694161MaRDI QIDQ5272923
Tatiana Romina Hartinger, Martin Milanič
Publication date: 5 July 2017
Published in: Journal of Graph Theory (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1411.6663
circular arc graphcographstructural characterization of families of graphs1-perfectly orientable graphfraternally orientable graphin-tournament digraphcobipartite graph
Structural characterization of families of graphs (05C75) Directed graphs (digraphs), tournaments (05C20)
Related Items (4)
1-perfectly orientable \(K_4\)-minor-free and outerplanar graphs ⋮ 1-perfectly orientable \(K_{4}\)-minor-free and outerplanar graphs ⋮ Avoidable vertices and edges in graphs: existence, characterization, and applications ⋮ Treewidth versus Clique Number. I. Graph Classes with a Forbidden Structure
Cites Work
- Unnamed Item
- Unnamed Item
- Graphs of separability at most 2
- Approximation algorithms for intersection graphs
- Two remarks on circular arc graphs
- Fraternal augmentations, arrangeability and linear Ramsey numbers
- Characterizations and recognition of circular-arc graphs and subclasses: a survey
- A characterization of competition graphs
- String graphs. I: The number of critical nonstring graphs is infinite
- Structural conditions for cycle completable graphs
- An algorithm for fraternal orientation of graphs
- Characterization problems for graphs, partially ordered sets, lattices, and families of sets
- Normal fraternally orientable graphs satisfy the strong perfect graph conjecture
- In-tournament digraphs
- Intersection graphs of concatenable subtrees of graphs
- Computing roots of graphs is hard
- A characterization of normal fraternally orientable perfect graphs
- Algorithmic graph theory and perfect graphs
- Supereulerian graphs and excluded induced minors
- List homomorphisms and circular arc graphs
- Structural results on circular-arc graphs and circle graphs: a survey and the main open problems
- On cyclically orientable graphs
- A relationship between triangulated graphs, comparability graphs, proper interval graphs, proper circular-arc graphs, and nested interval graphs
- Intersection graphs of proper subtrees of unicyclic graphs
- On the Computation of the Competition Number of a Graph
- Digraphs
- The square root of a graph
- Characterizing circular-arc graphs
This page was built for publication: Partial Characterizations of 1‐Perfectly Orientable Graphs
