Mathematical Research Data Initiative
Main page
Recent changes
Random page
Help about MediaWiki
Create a new Item
Create a new Property
Create a new EntitySchema
Merge two items
In other projects
Discussion
View source
View history
Purge
English
Log in

scientific article

From MaRDI portal
Publication:2857436
Jump to:navigation, search

zbMath1274.05405MaRDI QIDQ2857436

Dieter Rautenbach, Jayme Luiz Szwarcfiter

Publication date: 1 November 2013

Full work available at URL: http://www.sciencedirect.com/science/article/pii/S1571065311001892

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.


Mathematics Subject Classification ID

Structural characterization of families of graphs (05C75) Graph representations (geometric and intersection representations, etc.) (05C62)


Related Items (1)

A Note on Candeal and Induráin’s Semiorder Separability Condition



Cites Work

  • Unnamed Item
  • Unnamed Item
  • Unnamed Item
  • A linear-time algorithm for proper interval graph recognition
  • Simple linear time recognition of unit interval graphs
  • Open-interval graphs versus closed-interval graphs
  • A short proof that `proper = unit'
  • A simple 3-sweep LBFS algorithm for the recognition of unit interval graphs
  • Algorithmic graph theory and perfect graphs
  • Incidence matrices, interval graphs and seriation in archeology
  • Structure theorems for some circular-arc graphs
  • A Fully Dynamic Algorithm for Recognizing and Representing Proper Interval Graphs
  • Scheduling Interval-Ordered Tasks
  • Graph Classes: A Survey
  • Pathwidth, Bandwidth, and Completion Problems to Proper Interval Graphs with Small Cliques




This page was built for publication:

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Publication:2857436&oldid=15794408"
Tools
What links here
Related changes
Special pages
Printable version
Permanent link
Page information
MaRDI portal item
This page was last edited on 3 February 2024, at 19:23.
Privacy policy
About MaRDI portal
Disclaimers
Imprint
Powered by MediaWiki