The n-ordered graphs: A new graph class
By Anthony Bonato, Jeannette C. M. Janssen, Changping Wang. 2009
70 citations recorded by the source corpus.
Subfields: Computational Theory and Mathematics, Electrical and Electronic Engineering
View Paper: https://www.semanticscholar.org/paper/7e1f74e159dcfffafdcd9ee1d57be41670272a7a
How researchers see this paper
The researchers whose trusted networks rank it highest, strongest advocate first. Every researcher gets a different order.
In Computational Theory and Mathematics
In Electrical and Electronic Engineering
Citations in the corpus
- On H-immersions (2008, unknown): “We remark that with dierent methods, Oum [ 7 ] showed that the rank-width of exactly one of bw(G) 2, bw(G) 1, or bw(G) if G is 2-connected.”
- A Dynamic Survey of Graph Labeling (2009, background): “Cranston [491] proved that for k > 2, every k-regular bipartite graph is antimagic.”
- Coloring plane graphs with independent crossings (2010, background): “Cranston [ 3 ] proved that any regular bipartite graph with minimum degree at least 2 is antimagic.”